YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:50:11,473 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:50:11,475 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:50:11,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:50:11,487 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:50:11,488 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:50:11,489 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:50:11,491 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:50:11,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:50:11,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:50:11,494 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:50:11,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:50:11,495 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:50:11,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:50:11,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:50:11,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:50:11,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:50:11,500 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:50:11,502 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:50:11,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:50:11,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:50:11,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:50:11,508 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:50:11,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:50:11,508 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:50:11,509 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:50:11,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:50:11,510 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:50:11,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:50:11,511 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:50:11,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:50:11,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:50:11,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:50:11,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:50:11,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:50:11,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:50:11,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:50:11,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:50:11,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:50:11,516 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:50:11,530 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:50:11,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:50:11,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:50:11,532 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:50:11,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:50:11,532 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:50:11,533 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:50:11,533 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:50:11,533 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:50:11,533 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:50:11,533 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:50:11,533 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:50:11,534 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:50:11,534 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:50:11,534 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:50:11,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:50:11,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:50:11,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:50:11,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:50:11,535 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:50:11,535 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:50:11,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:50:11,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:50:11,536 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:50:11,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:50:11,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:50:11,536 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:50:11,536 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:50:11,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:50:11,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:50:11,575 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:50:11,578 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:50:11,579 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:50:11,580 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:50:11,580 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:50:11,649 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/ecdf4f6287a04d658055155bd766aa9e/FLAG9b7d26427 !SESSION 2020-06-22 10:50:09.161 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 10:50:11.926 !MESSAGE Indexed 'FLAG9b7d26427' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 10:50:11,997 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:50:11,997 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:50:11,998 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:50:12,004 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/ecdf4f6287a04d658055155bd766aa9e/FLAG9b7d26427 [2020-06-22 10:50:12,447 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/ecdf4f6287a04d658055155bd766aa9e [2020-06-22 10:50:12,458 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:50:12,460 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:50:12,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:50:12,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:50:12,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:50:12,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12370bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12, skipping insertion in model container [2020-06-22 10:50:12,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:50:12,494 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:50:12,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:50:12,722 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:50:12,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:50:12,755 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:50:12,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12 WrapperNode [2020-06-22 10:50:12,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:50:12,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:50:12,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:50:12,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:50:12,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:50:12,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:50:12,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:50:12,797 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:50:12,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... [2020-06-22 10:50:12,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:50:12,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:50:12,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:50:12,822 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:50:12,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:50:12,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:50:12,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:50:12,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:50:13,181 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:50:13,182 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:50:13,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:50:13 BoogieIcfgContainer [2020-06-22 10:50:13,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:50:13,184 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:50:13,184 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:50:13,186 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:50:13,189 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:50:13" (1/1) ... [2020-06-22 10:50:13,209 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 48 edges [2020-06-22 10:50:13,210 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:50:13,211 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:50:13,212 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:50:13,212 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:50:13,214 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:50:13,215 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:50:13,215 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:50:13,239 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:50:13,284 INFO L200 BlockEncoder]: SBE split 27 edges [2020-06-22 10:50:13,290 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:50:13,291 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:50:13,323 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:50:13,325 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:50:13,328 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:50:13,329 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:50:13,329 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:50:13,329 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:50:13,330 INFO L313 BlockEncoder]: Encoded RCFG 40 locations, 81 edges [2020-06-22 10:50:13,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:50:13 BasicIcfg [2020-06-22 10:50:13,331 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:50:13,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:50:13,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:50:13,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:50:13,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:50:12" (1/4) ... [2020-06-22 10:50:13,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d5bf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:50:13, skipping insertion in model container [2020-06-22 10:50:13,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (2/4) ... [2020-06-22 10:50:13,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d5bf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:50:13, skipping insertion in model container [2020-06-22 10:50:13,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:50:13" (3/4) ... [2020-06-22 10:50:13,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d5bf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:50:13, skipping insertion in model container [2020-06-22 10:50:13,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:50:13" (4/4) ... [2020-06-22 10:50:13,339 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:50:13,349 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:50:13,357 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-06-22 10:50:13,373 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-06-22 10:50:13,402 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:50:13,403 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:50:13,403 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:50:13,404 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:50:13,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:50:13,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:50:13,404 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:50:13,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:50:13,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:50:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-06-22 10:50:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:50:13,425 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:13,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:50:13,426 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:13,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash 124461, now seen corresponding path program 1 times [2020-06-22 10:50:13,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:13,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:13,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:13,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:13,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:13,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:13,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:13,647 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-06-22 10:50:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:13,892 INFO L93 Difference]: Finished difference Result 40 states and 81 transitions. [2020-06-22 10:50:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:13,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:50:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:13,908 INFO L225 Difference]: With dead ends: 40 [2020-06-22 10:50:13,908 INFO L226 Difference]: Without dead ends: 37 [2020-06-22 10:50:13,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:13,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-06-22 10:50:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-06-22 10:50:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 10:50:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 75 transitions. [2020-06-22 10:50:13,951 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 75 transitions. Word has length 3 [2020-06-22 10:50:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:13,952 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 75 transitions. [2020-06-22 10:50:13,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 75 transitions. [2020-06-22 10:50:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:50:13,953 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:13,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:50:13,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash 124463, now seen corresponding path program 1 times [2020-06-22 10:50:13,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:13,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:13,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:13,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:13,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:13,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:13,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:13,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:13,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:13,985 INFO L87 Difference]: Start difference. First operand 37 states and 75 transitions. Second operand 3 states. [2020-06-22 10:50:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:14,118 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2020-06-22 10:50:14,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:14,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:50:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:14,120 INFO L225 Difference]: With dead ends: 40 [2020-06-22 10:50:14,120 INFO L226 Difference]: Without dead ends: 37 [2020-06-22 10:50:14,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-06-22 10:50:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-06-22 10:50:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 10:50:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 72 transitions. [2020-06-22 10:50:14,127 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 72 transitions. Word has length 3 [2020-06-22 10:50:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:14,127 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 72 transitions. [2020-06-22 10:50:14,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 72 transitions. [2020-06-22 10:50:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:50:14,128 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:14,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:50:14,128 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash 124464, now seen corresponding path program 1 times [2020-06-22 10:50:14,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:14,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:14,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:14,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:14,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:14,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:14,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:14,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,192 INFO L87 Difference]: Start difference. First operand 37 states and 72 transitions. Second operand 3 states. [2020-06-22 10:50:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:14,339 INFO L93 Difference]: Finished difference Result 37 states and 72 transitions. [2020-06-22 10:50:14,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:14,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:50:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:14,356 INFO L225 Difference]: With dead ends: 37 [2020-06-22 10:50:14,356 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 10:50:14,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 10:50:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 10:50:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 10:50:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 69 transitions. [2020-06-22 10:50:14,361 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 69 transitions. Word has length 3 [2020-06-22 10:50:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:14,362 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 69 transitions. [2020-06-22 10:50:14,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 69 transitions. [2020-06-22 10:50:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:50:14,362 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:14,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:50:14,363 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash 3856710, now seen corresponding path program 1 times [2020-06-22 10:50:14,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:14,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:14,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:14,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:14,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:14,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:14,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:14,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,403 INFO L87 Difference]: Start difference. First operand 34 states and 69 transitions. Second operand 3 states. [2020-06-22 10:50:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:14,555 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. [2020-06-22 10:50:14,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:14,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:50:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:14,556 INFO L225 Difference]: With dead ends: 34 [2020-06-22 10:50:14,556 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 10:50:14,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 10:50:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 10:50:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 10:50:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 65 transitions. [2020-06-22 10:50:14,561 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 65 transitions. Word has length 4 [2020-06-22 10:50:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:14,561 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 65 transitions. [2020-06-22 10:50:14,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 65 transitions. [2020-06-22 10:50:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:50:14,562 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:14,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:50:14,563 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:14,563 INFO L82 PathProgramCache]: Analyzing trace with hash 3856712, now seen corresponding path program 1 times [2020-06-22 10:50:14,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:14,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:14,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:14,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:14,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:14,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:14,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:14,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,591 INFO L87 Difference]: Start difference. First operand 32 states and 65 transitions. Second operand 3 states. [2020-06-22 10:50:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:14,700 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2020-06-22 10:50:14,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:14,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:50:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:14,701 INFO L225 Difference]: With dead ends: 34 [2020-06-22 10:50:14,701 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 10:50:14,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 10:50:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 10:50:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 10:50:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 63 transitions. [2020-06-22 10:50:14,706 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 63 transitions. Word has length 4 [2020-06-22 10:50:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:14,708 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 63 transitions. [2020-06-22 10:50:14,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 63 transitions. [2020-06-22 10:50:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:50:14,708 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:14,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:50:14,709 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 3856713, now seen corresponding path program 1 times [2020-06-22 10:50:14,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:14,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:14,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:14,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:14,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:14,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:14,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:14,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,756 INFO L87 Difference]: Start difference. First operand 32 states and 63 transitions. Second operand 3 states. [2020-06-22 10:50:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:14,866 INFO L93 Difference]: Finished difference Result 32 states and 63 transitions. [2020-06-22 10:50:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:14,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:50:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:14,868 INFO L225 Difference]: With dead ends: 32 [2020-06-22 10:50:14,868 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:50:14,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:50:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 10:50:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:50:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 61 transitions. [2020-06-22 10:50:14,873 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 61 transitions. Word has length 4 [2020-06-22 10:50:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:14,873 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 61 transitions. [2020-06-22 10:50:14,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 61 transitions. [2020-06-22 10:50:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:50:14,873 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:14,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:50:14,874 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:14,874 INFO L82 PathProgramCache]: Analyzing trace with hash 119556186, now seen corresponding path program 1 times [2020-06-22 10:50:14,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:14,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:14,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:14,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:14,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:14,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:14,907 INFO L87 Difference]: Start difference. First operand 30 states and 61 transitions. Second operand 3 states. [2020-06-22 10:50:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:15,009 INFO L93 Difference]: Finished difference Result 30 states and 61 transitions. [2020-06-22 10:50:15,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:15,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:50:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:15,010 INFO L225 Difference]: With dead ends: 30 [2020-06-22 10:50:15,010 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:50:15,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:50:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:50:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:50:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. [2020-06-22 10:50:15,014 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 55 transitions. Word has length 5 [2020-06-22 10:50:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:15,014 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 55 transitions. [2020-06-22 10:50:15,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 55 transitions. [2020-06-22 10:50:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:50:15,015 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:15,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:50:15,015 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash 119556187, now seen corresponding path program 1 times [2020-06-22 10:50:15,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:15,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:15,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:15,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:15,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:15,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:15,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:15,054 INFO L87 Difference]: Start difference. First operand 27 states and 55 transitions. Second operand 3 states. [2020-06-22 10:50:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:15,141 INFO L93 Difference]: Finished difference Result 27 states and 55 transitions. [2020-06-22 10:50:15,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:15,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:50:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:15,142 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:50:15,143 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:50:15,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:50:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:50:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:50:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 49 transitions. [2020-06-22 10:50:15,147 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 49 transitions. Word has length 5 [2020-06-22 10:50:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:15,147 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 49 transitions. [2020-06-22 10:50:15,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 49 transitions. [2020-06-22 10:50:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:50:15,148 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:15,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:50:15,148 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:15,148 INFO L82 PathProgramCache]: Analyzing trace with hash -588728281, now seen corresponding path program 1 times [2020-06-22 10:50:15,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:15,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:15,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:15,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:15,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:15,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:15,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:15,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:15,177 INFO L87 Difference]: Start difference. First operand 24 states and 49 transitions. Second operand 3 states. [2020-06-22 10:50:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:15,282 INFO L93 Difference]: Finished difference Result 24 states and 49 transitions. [2020-06-22 10:50:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:15,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:50:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:15,283 INFO L225 Difference]: With dead ends: 24 [2020-06-22 10:50:15,283 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:50:15,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:50:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:50:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:50:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2020-06-22 10:50:15,287 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 6 [2020-06-22 10:50:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:15,287 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2020-06-22 10:50:15,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:15,287 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2020-06-22 10:50:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:50:15,288 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:50:15,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:50:15,288 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 10:50:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash -588728279, now seen corresponding path program 1 times [2020-06-22 10:50:15,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:15,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:15,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:50:15,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:50:15,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:50:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:50:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:15,323 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 3 states. [2020-06-22 10:50:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:50:15,411 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2020-06-22 10:50:15,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:50:15,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:50:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:50:15,412 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:50:15,412 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:50:15,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:50:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:50:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:50:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:50:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:50:15,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-06-22 10:50:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:50:15,414 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:50:15,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:50:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:50:15,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:50:15,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:50:15,457 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:50:15,457 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 10:50:15,457 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-06-22 10:50:15,457 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:50:15,458 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 14 18) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_f_~x_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~y_ref~0.base)) (= (select |#length| ULTIMATE.start_f_~y_ref~0.base) 4) (= 0 ULTIMATE.start_f_~flag~0.offset) (= (select |#valid| ULTIMATE.start_f_~c~0.base) 1) (= ULTIMATE.start_f_~y_ref~0.offset 0) (= 0 ULTIMATE.start_f_~c~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~flag~0.base)) (= (select |#length| ULTIMATE.start_f_~c~0.base) 4) (= 4 (select |#length| ULTIMATE.start_f_~flag~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~x_ref~0.base)) (= ULTIMATE.start_f_~x_ref~0.offset 0)) [2020-06-22 10:50:15,458 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2020-06-22 10:50:15,458 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:50:15,458 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 10:50:15,458 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:50:15,458 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:50:15,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point L16-3(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,461 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:50:15,462 INFO L448 ceAbstractionStarter]: For program point L16-4(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,462 INFO L448 ceAbstractionStarter]: For program point L16-5(line 16) no Hoare annotation was computed. [2020-06-22 10:50:15,462 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:50:15,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:50:15,472 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:50:15,473 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:50:15,473 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:50:15,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:50:15,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:50:15,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:50:15,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:50:15,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:50:15 BasicIcfg [2020-06-22 10:50:15,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:50:15,483 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:50:15,483 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:50:15,486 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:50:15,487 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:50:15,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:50:12" (1/5) ... [2020-06-22 10:50:15,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38bbef04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:50:15, skipping insertion in model container [2020-06-22 10:50:15,488 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:50:15,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:50:12" (2/5) ... [2020-06-22 10:50:15,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38bbef04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:50:15, skipping insertion in model container [2020-06-22 10:50:15,488 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:50:15,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:50:13" (3/5) ... [2020-06-22 10:50:15,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38bbef04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:50:15, skipping insertion in model container [2020-06-22 10:50:15,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:50:15,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:50:13" (4/5) ... [2020-06-22 10:50:15,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38bbef04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:50:15, skipping insertion in model container [2020-06-22 10:50:15,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:50:15,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:50:15" (5/5) ... [2020-06-22 10:50:15,491 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:50:15,512 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:50:15,513 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:50:15,513 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:50:15,513 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:50:15,513 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:50:15,513 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:50:15,513 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:50:15,513 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:50:15,513 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:50:15,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-06-22 10:50:15,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 10:50:15,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:50:15,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:50:15,527 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:50:15,527 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:50:15,527 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:50:15,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-06-22 10:50:15,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 10:50:15,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:50:15,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:50:15,530 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:50:15,530 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:50:15,536 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [150] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 35#L11true [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 32#L11-1true [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 14#L12true [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 39#L13true [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 40#L15-2true [2020-06-22 10:50:15,536 INFO L796 eck$LassoCheckResult]: Loop: 40#L15-2true [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 24#L15true [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 5#L16true [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 22#L16-2true [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 19#L16-3true [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 15#L16-4true [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13#L16-5true [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 28#L17true [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 26#L17-1true [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 40#L15-2true [2020-06-22 10:50:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash -574875528, now seen corresponding path program 1 times [2020-06-22 10:50:15,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:15,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:15,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:15,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 1 times [2020-06-22 10:50:15,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:15,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:15,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:15,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash 618941447, now seen corresponding path program 1 times [2020-06-22 10:50:15,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:50:15,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:50:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:50:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:50:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:15,786 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-06-22 10:50:16,402 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 101 [2020-06-22 10:50:16,642 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-06-22 10:50:16,656 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:50:16,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:50:16,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:50:16,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:50:16,658 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:50:16,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:50:16,658 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:50:16,658 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:50:16,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:50:16,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:50:16,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:50:16,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:16,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:17,223 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2020-06-22 10:50:17,386 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-06-22 10:50:17,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:17,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:50:17,629 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-06-22 10:50:17,949 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:50:17,955 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:50:17,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:50:17,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:50:17,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:50:17,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:50:17,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:50:17,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:50:17,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:50:17,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:50:17,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:50:17,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:50:17,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:50:17,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:50:17,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:17,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:17,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:50:17,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:50:17,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:50:17,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:17,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:17,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:50:17,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:50:17,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:50:17,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:50:17,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:50:17,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:50:17,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:17,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:17,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:17,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:17,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:17,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:17,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:17,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:17,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:50:18,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:50:18,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:50:18,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:50:18,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:50:18,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:50:18,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:50:18,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:50:18,141 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:50:18,156 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:50:18,156 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:50:18,159 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:50:18,160 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:50:18,160 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:50:18,161 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_1 Supporting invariants [] [2020-06-22 10:50:18,338 INFO L297 tatePredicateManager]: 38 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 10:50:18,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:50:18,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:50:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:50:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:18,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 10:50:18,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:50:18,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:50:18,452 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:50:18,453 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:50:18,471 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:50:18,472 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:50:18,472 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2020-06-22 10:50:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:18,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:50:18,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:50:18,630 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:50:18,631 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2020-06-22 10:50:18,632 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:50:18,659 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 10:50:18,660 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:50:18,660 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2020-06-22 10:50:18,764 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:50:18,765 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 [2020-06-22 10:50:18,775 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:50:18,878 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-06-22 10:50:18,879 INFO L497 ElimStorePlain]: treesize reduction 70, result has 50.0 percent of original size [2020-06-22 10:50:18,880 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:50:18,881 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 [2020-06-22 10:50:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:50:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:20,061 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:50:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:20,072 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:50:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:20,083 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:50:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:50:20,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:50:20,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:50:20,174 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:50:20,174 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 70 [2020-06-22 10:50:20,180 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:50:20,235 INFO L497 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size [2020-06-22 10:50:20,237 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:50:20,237 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:58 [2020-06-22 10:50:28,463 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 38 [2020-06-22 10:50:28,491 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:50:28,491 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2020-06-22 10:50:28,492 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:50:28,517 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 10:50:28,517 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:50:28,518 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2020-06-22 10:50:29,523 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_f_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_f_~c~0.base c_ULTIMATE.start_f_~x_ref~0.base) (= c_ULTIMATE.start_f_~x_ref~0.offset ULTIMATE.start_f_~c~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~y_ref~0.base) c_ULTIMATE.start_f_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~c~0.base) c_ULTIMATE.start_f_~x_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 10:50:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:50:29,538 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:50:29,538 INFO L98 LoopCannibalizer]: 29 predicates before loop cannibalization 33 predicates after loop cannibalization [2020-06-22 10:50:29,542 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 33 loop predicates [2020-06-22 10:50:29,543 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 40 states. Second operand 10 states. [2020-06-22 10:50:37,381 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-06-22 10:50:39,017 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-06-22 10:50:39,610 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-06-22 10:50:41,310 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-06-22 10:50:41,979 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-06-22 10:50:44,824 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2020-06-22 10:50:59,842 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 40 states.. Second operand 10 states. Result 4212 states and 7147 transitions. Complement of second has 1181 states. [2020-06-22 10:50:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 189 states 17 stem states 166 non-accepting loop states 6 accepting loop states [2020-06-22 10:50:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:50:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 2059 transitions. [2020-06-22 10:50:59,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 2059 transitions. Stem has 6 letters. Loop has 9 letters. [2020-06-22 10:50:59,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:50:59,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 2059 transitions. Stem has 15 letters. Loop has 9 letters. [2020-06-22 10:50:59,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:50:59,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 2059 transitions. Stem has 6 letters. Loop has 18 letters. [2020-06-22 10:50:59,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:50:59,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4212 states and 7147 transitions. [2020-06-22 10:50:59,978 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 432 [2020-06-22 10:50:59,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4212 states to 822 states and 985 transitions. [2020-06-22 10:50:59,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 756 [2020-06-22 10:50:59,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 788 [2020-06-22 10:50:59,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 822 states and 985 transitions. [2020-06-22 10:50:59,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:50:59,992 INFO L706 BuchiCegarLoop]: Abstraction has 822 states and 985 transitions. [2020-06-22 10:50:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states and 985 transitions. [2020-06-22 10:51:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 62. [2020-06-22 10:51:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 10:51:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2020-06-22 10:51:00,007 INFO L729 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. [2020-06-22 10:51:00,007 INFO L609 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. [2020-06-22 10:51:00,008 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:51:00,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 87 transitions. [2020-06-22 10:51:00,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-06-22 10:51:00,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:51:00,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:51:00,009 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:51:00,009 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:51:00,010 INFO L794 eck$LassoCheckResult]: Stem: 6138#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 6132#L-1 [142] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 6134#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 6136#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 6137#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 6143#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 6123#L15-2 [2020-06-22 10:51:00,011 INFO L796 eck$LassoCheckResult]: Loop: 6123#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 6150#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 6126#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 6127#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 6147#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 6148#L16-4 [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 6139#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 6129#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 6122#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 6123#L15-2 [2020-06-22 10:51:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash -582263696, now seen corresponding path program 1 times [2020-06-22 10:51:00,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:00,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:00,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:00,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:51:00,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:00,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 2 times [2020-06-22 10:51:00,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:00,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:00,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:00,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:51:00,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash 368443151, now seen corresponding path program 1 times [2020-06-22 10:51:00,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:00,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:51:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:00,982 WARN L188 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2020-06-22 10:51:01,304 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-06-22 10:51:01,308 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:51:01,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:51:01,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:51:01,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:51:01,309 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:51:01,309 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:51:01,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:51:01,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:51:01,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:51:01,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:51:01,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:51:01,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:01,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:01,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:01,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:01,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:01,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:01,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:01,861 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 [2020-06-22 10:51:02,022 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-06-22 10:51:02,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:02,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:02,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:02,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:02,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:02,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:02,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:02,167 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-06-22 10:51:02,580 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:51:02,580 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:51:02,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:51:02,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:51:02,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:51:02,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:02,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:02,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:02,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:02,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:51:02,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:51:02,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:51:02,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:02,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:02,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:02,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:02,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:51:02,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:51:02,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:51:02,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:02,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:02,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:02,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:02,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:02,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:02,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:02,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:02,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:02,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:02,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:02,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:02,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:02,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:02,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:02,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:02,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:02,644 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:51:02,650 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:51:02,650 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:51:02,650 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:51:02,651 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:51:02,652 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:51:02,652 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_2 Supporting invariants [] [2020-06-22 10:51:02,824 INFO L297 tatePredicateManager]: 38 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 10:51:02,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:51:02,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:51:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:51:02,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 10:51:02,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:51:02,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:51:02,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:51:02,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:51:02,908 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:02,909 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2020-06-22 10:51:02,910 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:02,929 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:02,929 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:51:02,930 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-06-22 10:51:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:51:02,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:51:02,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:51:03,070 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:03,071 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2020-06-22 10:51:03,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:03,097 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 10:51:03,097 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:51:03,097 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2020-06-22 10:51:03,189 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:03,189 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 [2020-06-22 10:51:03,196 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:03,258 INFO L497 ElimStorePlain]: treesize reduction 45, result has 61.2 percent of original size [2020-06-22 10:51:03,260 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:51:03,260 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 [2020-06-22 10:51:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:51:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:04,367 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:51:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:04,377 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:51:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:04,387 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:51:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:51:04,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:51:04,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:51:04,473 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:04,474 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 70 [2020-06-22 10:51:04,478 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:04,538 INFO L497 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size [2020-06-22 10:51:04,540 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:51:04,540 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:58 [2020-06-22 10:51:11,897 WARN L188 SmtUtils]: Spent 3.54 s on a formula simplification that was a NOOP. DAG size: 38 [2020-06-22 10:51:11,923 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:11,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2020-06-22 10:51:11,924 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:11,949 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 10:51:11,949 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:51:11,949 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2020-06-22 10:51:12,948 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_f_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_f_~c~0.base c_ULTIMATE.start_f_~x_ref~0.base) (= c_ULTIMATE.start_f_~x_ref~0.offset ULTIMATE.start_f_~c~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~y_ref~0.base) c_ULTIMATE.start_f_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~c~0.base) c_ULTIMATE.start_f_~x_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 10:51:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:12,962 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:51:12,962 INFO L98 LoopCannibalizer]: 29 predicates before loop cannibalization 33 predicates after loop cannibalization [2020-06-22 10:51:12,963 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 33 loop predicates [2020-06-22 10:51:12,963 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 62 states and 87 transitions. cyclomatic complexity: 28 Second operand 10 states. [2020-06-22 10:51:16,974 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-06-22 10:51:19,492 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2020-06-22 10:51:29,325 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 62 states and 87 transitions. cyclomatic complexity: 28. Second operand 10 states. Result 1468 states and 1795 transitions. Complement of second has 827 states. [2020-06-22 10:51:29,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 118 states 9 stem states 106 non-accepting loop states 3 accepting loop states [2020-06-22 10:51:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:51:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 310 transitions. [2020-06-22 10:51:29,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 6 letters. Loop has 9 letters. [2020-06-22 10:51:29,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:51:29,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 15 letters. Loop has 9 letters. [2020-06-22 10:51:29,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:51:29,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 6 letters. Loop has 18 letters. [2020-06-22 10:51:29,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:51:29,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1468 states and 1795 transitions. [2020-06-22 10:51:29,365 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 458 [2020-06-22 10:51:29,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1468 states to 798 states and 969 transitions. [2020-06-22 10:51:29,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2020-06-22 10:51:29,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 676 [2020-06-22 10:51:29,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 798 states and 969 transitions. [2020-06-22 10:51:29,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:51:29,371 INFO L706 BuchiCegarLoop]: Abstraction has 798 states and 969 transitions. [2020-06-22 10:51:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states and 969 transitions. [2020-06-22 10:51:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 62. [2020-06-22 10:51:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 10:51:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2020-06-22 10:51:29,379 INFO L729 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. [2020-06-22 10:51:29,380 INFO L609 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. [2020-06-22 10:51:29,380 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:51:29,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 87 transitions. [2020-06-22 10:51:29,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-06-22 10:51:29,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:51:29,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:51:29,381 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:51:29,381 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:51:29,382 INFO L794 eck$LassoCheckResult]: Stem: 9027#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9021#L-1 [140] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 9023#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 9025#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 9026#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 9032#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 9014#L15-2 [2020-06-22 10:51:29,382 INFO L796 eck$LassoCheckResult]: Loop: 9014#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 9009#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 9010#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 9017#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 9036#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 9037#L16-4 [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 9028#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 9019#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 9013#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 9014#L15-2 [2020-06-22 10:51:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash -584110738, now seen corresponding path program 1 times [2020-06-22 10:51:29,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:29,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:29,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:29,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:51:29,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 3 times [2020-06-22 10:51:29,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:29,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:29,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:51:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1379560401, now seen corresponding path program 1 times [2020-06-22 10:51:29,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:29,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:29,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:51:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:30,021 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 101 [2020-06-22 10:51:30,220 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-06-22 10:51:30,224 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:51:30,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:51:30,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:51:30,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:51:30,224 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:51:30,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:51:30,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:51:30,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:51:30,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:51:30,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:51:30,225 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:51:30,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,695 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2020-06-22 10:51:30,850 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-06-22 10:51:30,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:30,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:31,318 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:51:31,318 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:51:31,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:51:31,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:51:31,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:51:31,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:51:31,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:51:31,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:51:31,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:31,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:31,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:51:31,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:51:31,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:51:31,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:31,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:31,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:51:31,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:51:31,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:51:31,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:31,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:31,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:31,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:31,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:31,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:31,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:31,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:31,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:31,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:31,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:51:31,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:51:31,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:51:31,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:51:31,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:51:31,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:51:31,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:51:31,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:51:31,370 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:51:31,376 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:51:31,376 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:51:31,376 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:51:31,377 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:51:31,377 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:51:31,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_3 Supporting invariants [] [2020-06-22 10:51:31,565 INFO L297 tatePredicateManager]: 38 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 10:51:31,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:51:31,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:51:31,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:51:31,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 10:51:31,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:51:31,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:51:31,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:51:31,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:51:31,648 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:31,649 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2020-06-22 10:51:31,649 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:31,666 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:31,667 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:51:31,667 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-06-22 10:51:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:51:31,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:51:31,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:51:31,838 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:31,839 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2020-06-22 10:51:31,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:31,867 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 10:51:31,868 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:51:31,868 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2020-06-22 10:51:31,961 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:31,961 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 [2020-06-22 10:51:31,966 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:32,041 INFO L497 ElimStorePlain]: treesize reduction 45, result has 61.2 percent of original size [2020-06-22 10:51:32,042 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:51:32,042 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 [2020-06-22 10:51:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:51:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:33,146 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:51:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:33,155 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:51:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:33,165 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:51:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:51:33,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:51:33,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:51:33,254 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:33,255 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 70 [2020-06-22 10:51:33,259 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:33,322 INFO L497 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size [2020-06-22 10:51:33,323 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:51:33,323 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:58 [2020-06-22 10:51:41,678 WARN L188 SmtUtils]: Spent 3.58 s on a formula simplification that was a NOOP. DAG size: 38 [2020-06-22 10:51:41,706 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:51:41,706 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2020-06-22 10:51:41,707 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:51:41,738 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 10:51:41,738 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:51:41,738 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2020-06-22 10:51:42,755 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_f_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_f_~c~0.base c_ULTIMATE.start_f_~x_ref~0.base) (= c_ULTIMATE.start_f_~x_ref~0.offset ULTIMATE.start_f_~c~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~y_ref~0.base) c_ULTIMATE.start_f_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~c~0.base) c_ULTIMATE.start_f_~x_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 10:51:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:42,768 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:51:42,768 INFO L98 LoopCannibalizer]: 29 predicates before loop cannibalization 33 predicates after loop cannibalization [2020-06-22 10:51:42,769 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 33 loop predicates [2020-06-22 10:51:42,769 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 62 states and 87 transitions. cyclomatic complexity: 28 Second operand 10 states. [2020-06-22 10:51:46,749 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-06-22 10:51:47,406 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-06-22 10:51:48,314 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2020-06-22 10:51:57,957 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 62 states and 87 transitions. cyclomatic complexity: 28. Second operand 10 states. Result 1637 states and 1997 transitions. Complement of second has 827 states. [2020-06-22 10:51:57,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 118 states 9 stem states 106 non-accepting loop states 3 accepting loop states [2020-06-22 10:51:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:51:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 310 transitions. [2020-06-22 10:51:57,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 6 letters. Loop has 9 letters. [2020-06-22 10:51:57,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:51:57,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 15 letters. Loop has 9 letters. [2020-06-22 10:51:57,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:51:57,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 6 letters. Loop has 18 letters. [2020-06-22 10:51:57,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:51:57,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1637 states and 1997 transitions. [2020-06-22 10:51:57,981 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 467 [2020-06-22 10:51:57,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1637 states to 888 states and 1077 transitions. [2020-06-22 10:51:57,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 679 [2020-06-22 10:51:57,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 695 [2020-06-22 10:51:57,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 888 states and 1077 transitions. [2020-06-22 10:51:57,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:51:57,989 INFO L706 BuchiCegarLoop]: Abstraction has 888 states and 1077 transitions. [2020-06-22 10:51:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states and 1077 transitions. [2020-06-22 10:51:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 77. [2020-06-22 10:51:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-06-22 10:51:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2020-06-22 10:51:57,997 INFO L729 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2020-06-22 10:51:57,997 INFO L609 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2020-06-22 10:51:57,997 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:51:57,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 104 transitions. [2020-06-22 10:51:57,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-06-22 10:51:57,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:51:57,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:51:57,999 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:51:57,999 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:51:58,000 INFO L794 eck$LassoCheckResult]: Stem: 12089#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12082#L-1 [137] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 12084#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 12107#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 12106#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 12100#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 12074#L15-2 [2020-06-22 10:51:58,000 INFO L796 eck$LassoCheckResult]: Loop: 12074#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 12069#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 12070#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 12077#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12096#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 12097#L16-4 [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12090#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 12079#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 12073#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 12074#L15-2 [2020-06-22 10:51:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -586881301, now seen corresponding path program 1 times [2020-06-22 10:51:58,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:58,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:58,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:51:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 4 times [2020-06-22 10:51:58,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:58,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:58,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:51:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:51:58,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1398731020, now seen corresponding path program 1 times [2020-06-22 10:51:58,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:51:58,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:51:58,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:58,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:51:58,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:51:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:51:58,699 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2020-06-22 10:51:58,910 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-06-22 10:51:58,914 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:51:58,914 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:51:58,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:51:58,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:51:58,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:51:58,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:51:58,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:51:58,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:51:58,915 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:51:58,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:51:58,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:51:58,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:58,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:59,433 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2020-06-22 10:51:59,590 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-06-22 10:51:59,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:59,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:51:59,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:00,078 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:52:00,078 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:52:00,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:52:00,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:52:00,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:52:00,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:00,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:00,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:52:00,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:52:00,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:52:00,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:52:00,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:52:00,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:52:00,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:00,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:00,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:52:00,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:52:00,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:52:00,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:52:00,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:52:00,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:52:00,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:52:00,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:52:00,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:52:00,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:52:00,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:52:00,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:52:00,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:00,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:00,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:00,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:00,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:00,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:00,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:00,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:00,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:00,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:00,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:00,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:00,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:00,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:00,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:00,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:00,133 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:52:00,139 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:52:00,140 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:52:00,140 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:52:00,141 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:52:00,141 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:52:00,141 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_4) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_4 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_4 Supporting invariants [] [2020-06-22 10:52:00,320 INFO L297 tatePredicateManager]: 38 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 10:52:00,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:52:00,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:52:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:00,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 10:52:00,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:52:00,400 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:00,401 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-06-22 10:52:00,402 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:00,416 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:00,416 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:00,416 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:29 [2020-06-22 10:52:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:00,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:52:00,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:52:00,557 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:00,558 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2020-06-22 10:52:00,559 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:00,603 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 10:52:00,603 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:00,603 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2020-06-22 10:52:00,698 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:00,698 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 [2020-06-22 10:52:00,702 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:00,765 INFO L497 ElimStorePlain]: treesize reduction 70, result has 50.0 percent of original size [2020-06-22 10:52:00,767 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:52:00,767 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 [2020-06-22 10:52:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:52:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:01,765 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:52:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:01,774 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:52:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:01,784 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:52:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:01,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:52:01,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:52:01,868 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:01,869 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 70 [2020-06-22 10:52:01,872 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:01,934 INFO L497 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size [2020-06-22 10:52:01,935 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:52:01,936 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:58 [2020-06-22 10:52:10,336 WARN L188 SmtUtils]: Spent 3.58 s on a formula simplification that was a NOOP. DAG size: 38 [2020-06-22 10:52:10,362 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:10,363 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2020-06-22 10:52:10,363 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:10,388 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 10:52:10,388 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:10,389 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2020-06-22 10:52:11,393 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_f_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_f_~c~0.base c_ULTIMATE.start_f_~x_ref~0.base) (= c_ULTIMATE.start_f_~x_ref~0.offset ULTIMATE.start_f_~c~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~y_ref~0.base) c_ULTIMATE.start_f_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~c~0.base) c_ULTIMATE.start_f_~x_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 10:52:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:11,407 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:52:11,407 INFO L98 LoopCannibalizer]: 29 predicates before loop cannibalization 33 predicates after loop cannibalization [2020-06-22 10:52:11,407 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 33 loop predicates [2020-06-22 10:52:11,408 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 77 states and 104 transitions. cyclomatic complexity: 30 Second operand 10 states. [2020-06-22 10:52:13,565 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-06-22 10:52:15,552 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2020-06-22 10:52:21,637 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 77 states and 104 transitions. cyclomatic complexity: 30. Second operand 10 states. Result 270 states and 341 transitions. Complement of second has 120 states. [2020-06-22 10:52:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 62 states 2 stem states 58 non-accepting loop states 2 accepting loop states [2020-06-22 10:52:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:52:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 122 transitions. [2020-06-22 10:52:21,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 122 transitions. Stem has 6 letters. Loop has 9 letters. [2020-06-22 10:52:21,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:52:21,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 122 transitions. Stem has 15 letters. Loop has 9 letters. [2020-06-22 10:52:21,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:52:21,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 122 transitions. Stem has 6 letters. Loop has 18 letters. [2020-06-22 10:52:21,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:52:21,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 341 transitions. [2020-06-22 10:52:21,650 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 67 [2020-06-22 10:52:21,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 168 states and 214 transitions. [2020-06-22 10:52:21,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2020-06-22 10:52:21,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2020-06-22 10:52:21,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 214 transitions. [2020-06-22 10:52:21,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:52:21,661 INFO L706 BuchiCegarLoop]: Abstraction has 168 states and 214 transitions. [2020-06-22 10:52:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 214 transitions. [2020-06-22 10:52:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 58. [2020-06-22 10:52:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-06-22 10:52:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2020-06-22 10:52:21,666 INFO L729 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2020-06-22 10:52:21,666 INFO L609 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2020-06-22 10:52:21,666 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:52:21,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2020-06-22 10:52:21,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-06-22 10:52:21,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:52:21,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:52:21,667 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:52:21,667 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:52:21,668 INFO L794 eck$LassoCheckResult]: Stem: 12972#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12967#L-1 [143] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 12968#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 12977#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 12982#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 12983#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 13000#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13001#L15 [2020-06-22 10:52:21,668 INFO L796 eck$LassoCheckResult]: Loop: 13001#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13005#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13004#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12984#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 12978#L16-4 [190] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 0)) |v_#memory_int_14|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (>= |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12979#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13011#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 13010#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 13009#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13001#L15 [2020-06-22 10:52:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash -841676136, now seen corresponding path program 1 times [2020-06-22 10:52:21,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:52:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:52:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:52:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:21,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:21,690 INFO L82 PathProgramCache]: Analyzing trace with hash 455833011, now seen corresponding path program 1 times [2020-06-22 10:52:21,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:52:21,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:52:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:21,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:52:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash 45311228, now seen corresponding path program 1 times [2020-06-22 10:52:21,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:52:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:52:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:21,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:52:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:22,400 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 110 [2020-06-22 10:52:22,642 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-06-22 10:52:22,646 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:52:22,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:52:22,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:52:22,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:52:22,647 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:52:22,647 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:52:22,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:52:22,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:52:22,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:52:22,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:52:22,647 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:52:22,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:22,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,128 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2020-06-22 10:52:23,306 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-06-22 10:52:23,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:52:23,503 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-06-22 10:52:23,932 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:52:23,933 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:52:23,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:52:23,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:52:23,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:52:23,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:52:23,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:52:23,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:52:23,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:52:23,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:52:23,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:52:23,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:52:23,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:52:23,996 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:52:24,000 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:52:24,000 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:52:24,000 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:52:24,001 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:52:24,001 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:52:24,001 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_#t~mem8) = 1*ULTIMATE.start_f_#t~mem8 Supporting invariants [] [2020-06-22 10:52:24,155 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 10:52:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:24,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:52:24,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:52:24,202 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-06-22 10:52:24,202 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,209 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:24,210 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,210 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:6 [2020-06-22 10:52:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:24,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:52:24,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:52:24,234 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 10:52:24,234 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,239 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:24,240 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,240 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-06-22 10:52:24,257 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:52:24,257 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,264 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:24,264 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,264 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 [2020-06-22 10:52:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:52:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:24,300 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:52:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:24,309 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:52:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:52:24,318 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:52:24,318 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:52:24,318 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 10:52:24,318 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 58 states and 83 transitions. cyclomatic complexity: 28 Second operand 5 states. [2020-06-22 10:52:24,494 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 58 states and 83 transitions. cyclomatic complexity: 28. Second operand 5 states. Result 352 states and 433 transitions. Complement of second has 64 states. [2020-06-22 10:52:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 10:52:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:52:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2020-06-22 10:52:24,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 7 letters. Loop has 9 letters. [2020-06-22 10:52:24,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:52:24,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 16 letters. Loop has 9 letters. [2020-06-22 10:52:24,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:52:24,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 7 letters. Loop has 18 letters. [2020-06-22 10:52:24,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:52:24,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 433 transitions. [2020-06-22 10:52:24,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2020-06-22 10:52:24,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 133 states and 172 transitions. [2020-06-22 10:52:24,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-06-22 10:52:24,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-06-22 10:52:24,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 172 transitions. [2020-06-22 10:52:24,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:52:24,507 INFO L706 BuchiCegarLoop]: Abstraction has 133 states and 172 transitions. [2020-06-22 10:52:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 172 transitions. [2020-06-22 10:52:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 82. [2020-06-22 10:52:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-06-22 10:52:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2020-06-22 10:52:24,510 INFO L729 BuchiCegarLoop]: Abstraction has 82 states and 114 transitions. [2020-06-22 10:52:24,510 INFO L609 BuchiCegarLoop]: Abstraction has 82 states and 114 transitions. [2020-06-22 10:52:24,510 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:52:24,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 114 transitions. [2020-06-22 10:52:24,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2020-06-22 10:52:24,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:52:24,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:52:24,511 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:52:24,511 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:52:24,512 INFO L794 eck$LassoCheckResult]: Stem: 13697#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13692#L-1 [143] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 13693#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 13695#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 13696#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 13713#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 13714#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13708#L15 [175] L15-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13719#L16 [2020-06-22 10:52:24,512 INFO L796 eck$LassoCheckResult]: Loop: 13719#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13718#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13709#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 13710#L16-4 [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13698#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13699#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 13728#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 13725#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13724#L15 [175] L15-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13719#L16 [2020-06-22 10:52:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash -322156265, now seen corresponding path program 1 times [2020-06-22 10:52:24,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:52:24,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:52:24,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:24,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:52:24,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:52:24,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:52:24,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:52:24,552 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:52:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1250598453, now seen corresponding path program 1 times [2020-06-22 10:52:24,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:52:24,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:52:24,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:24,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:52:24,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:52:24,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:52:24,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:52:24,658 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:52:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:52:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:52:24,658 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. cyclomatic complexity: 36 Second operand 6 states. [2020-06-22 10:52:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:52:24,840 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-06-22 10:52:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:52:24,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 124 transitions. [2020-06-22 10:52:24,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2020-06-22 10:52:24,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 96 states and 124 transitions. [2020-06-22 10:52:24,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-06-22 10:52:24,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-06-22 10:52:24,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 124 transitions. [2020-06-22 10:52:24,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:52:24,849 INFO L706 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2020-06-22 10:52:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 124 transitions. [2020-06-22 10:52:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2020-06-22 10:52:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-06-22 10:52:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2020-06-22 10:52:24,852 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2020-06-22 10:52:24,852 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2020-06-22 10:52:24,852 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:52:24,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 111 transitions. [2020-06-22 10:52:24,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 10:52:24,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:52:24,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:52:24,854 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:52:24,854 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:52:24,855 INFO L794 eck$LassoCheckResult]: Stem: 13891#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13886#L-1 [143] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 13887#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 13889#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 13890#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 13905#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 13906#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13872#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13873#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13936#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13933#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 13931#L16-4 [190] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 0)) |v_#memory_int_14|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (>= |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13927#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13924#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 13921#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 13918#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13915#L15 [175] L15-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13914#L16 [2020-06-22 10:52:24,855 INFO L796 eck$LassoCheckResult]: Loop: 13914#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13907#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13901#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 13902#L16-4 [190] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 0)) |v_#memory_int_14|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (>= |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13928#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13925#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 13922#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 13919#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13916#L15 [175] L15-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13914#L16 [2020-06-22 10:52:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1404648243, now seen corresponding path program 1 times [2020-06-22 10:52:24,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:52:24,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:52:24,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:24,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:52:24,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:52:24,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:52:24,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:52:24,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:52:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:24,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:52:24,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:52:24,962 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-06-22 10:52:24,962 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,968 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:24,969 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,969 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2020-06-22 10:52:24,982 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 10:52:24,982 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,987 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:24,988 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:24,988 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-06-22 10:52:25,008 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:52:25,008 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:25,017 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:25,018 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:25,018 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2020-06-22 10:52:25,022 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-06-22 10:52:25,022 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:52:25,024 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:52:25,024 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:52:25,024 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-06-22 10:52:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:52:25,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:52:25,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-06-22 10:52:25,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:52:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:52:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1221969302, now seen corresponding path program 1 times [2020-06-22 10:52:25,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:52:25,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:52:25,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:25,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:52:25,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:52:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:52:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:52:25,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:52:25,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:52:25,136 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:52:25,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:52:25,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:52:25,137 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. cyclomatic complexity: 32 Second operand 6 states. [2020-06-22 10:52:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:52:25,374 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-06-22 10:52:25,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:52:25,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 74 transitions. [2020-06-22 10:52:25,381 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:52:25,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2020-06-22 10:52:25,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:52:25,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:52:25,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:52:25,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:52:25,381 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:52:25,382 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:52:25,382 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:52:25,382 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:52:25,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:52:25,382 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:52:25,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:52:25,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:52:25 BasicIcfg [2020-06-22 10:52:25,388 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:52:25,389 INFO L168 Benchmark]: Toolchain (without parser) took 132929.78 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 353.4 MB). Free memory was 564.1 MB in the beginning and 513.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 404.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:52:25,389 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:52:25,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.70 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 564.1 MB in the beginning and 648.9 MB in the end (delta: -84.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:52:25,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.19 ms. Allocated memory is still 684.2 MB. Free memory was 648.9 MB in the beginning and 646.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:52:25,391 INFO L168 Benchmark]: Boogie Preprocessor took 24.55 ms. Allocated memory is still 684.2 MB. Free memory was 646.2 MB in the beginning and 644.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:52:25,392 INFO L168 Benchmark]: RCFGBuilder took 362.13 ms. Allocated memory is still 684.2 MB. Free memory was 644.8 MB in the beginning and 619.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:52:25,392 INFO L168 Benchmark]: BlockEncodingV2 took 146.79 ms. Allocated memory is still 684.2 MB. Free memory was 619.7 MB in the beginning and 607.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:52:25,392 INFO L168 Benchmark]: TraceAbstraction took 2150.75 ms. Allocated memory was 684.2 MB in the beginning and 750.8 MB in the end (delta: 66.6 MB). Free memory was 607.6 MB in the beginning and 671.1 MB in the end (delta: -63.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:52:25,393 INFO L168 Benchmark]: BuchiAutomizer took 129905.43 ms. Allocated memory was 750.8 MB in the beginning and 1.0 GB in the end (delta: 252.2 MB). Free memory was 671.1 MB in the beginning and 513.5 MB in the end (delta: 157.6 MB). Peak memory consumption was 409.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:52:25,396 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 47 locations, 48 edges - StatisticsResult: Encoded RCFG 40 locations, 81 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 294.70 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 564.1 MB in the beginning and 648.9 MB in the end (delta: -84.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.19 ms. Allocated memory is still 684.2 MB. Free memory was 648.9 MB in the beginning and 646.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.55 ms. Allocated memory is still 684.2 MB. Free memory was 646.2 MB in the beginning and 644.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 362.13 ms. Allocated memory is still 684.2 MB. Free memory was 644.8 MB in the beginning and 619.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 146.79 ms. Allocated memory is still 684.2 MB. Free memory was 619.7 MB in the beginning and 607.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2150.75 ms. Allocated memory was 684.2 MB in the beginning and 750.8 MB in the end (delta: 66.6 MB). Free memory was 607.6 MB in the beginning and 671.1 MB in the end (delta: -63.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 129905.43 ms. Allocated memory was 750.8 MB in the beginning and 1.0 GB in the end (delta: 252.2 MB). Free memory was 671.1 MB in the beginning and 513.5 MB in the end (delta: 157.6 MB). Peak memory consumption was 409.8 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 10:52:25,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:52:25,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:52:25,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:52:25,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:52:25,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:52:25,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:52:25,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:52:25,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((4 == unknown-#length-unknown[x_ref] && 1 == \valid[y_ref]) && unknown-#length-unknown[y_ref] == 4) && 0 == flag) && \valid[c] == 1) && y_ref == 0) && 0 == c) && 1 == \valid[flag]) && unknown-#length-unknown[c] == 4) && 4 == unknown-#length-unknown[flag]) && 1 == \valid[x_ref]) && x_ref == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 24 error locations. SAFE Result, 2.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 400 SDslu, 6 SDs, 0 SdLazy, 542 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 189 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 118 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 118 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 62 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6c56eec9 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 129.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 13.0s. Construction of modules took 8.1s. Büchi inclusion checks took 108.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2481 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 6. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 69 SDtfs, 8044 SDslu, 919 SDs, 0 SdLazy, 10200 SolverSat, 1986 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital514 mio100 ax100 hnf100 lsp98 ukn46 mio100 lsp39 div100 bol100 ite100 ukn100 eq190 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:52:25.636 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check