./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a398041f87cd84898ae142142fdf4872d746c3b1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:09:39,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:09:39,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:09:39,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:09:39,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:09:39,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:09:39,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:09:39,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:09:39,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:09:39,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:09:39,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:09:39,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:09:39,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:09:39,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:09:39,475 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:09:39,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:09:39,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:09:39,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:09:39,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:09:39,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:09:39,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:09:39,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:09:39,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:09:39,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:09:39,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:09:39,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:09:39,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:09:39,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:09:39,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:09:39,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:09:39,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:09:39,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:09:39,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:09:39,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:09:39,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:09:39,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:09:39,487 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:09:39,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:09:39,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:09:39,497 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:09:39,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:09:39,497 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:09:39,497 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:09:39,498 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:09:39,498 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:09:39,498 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:09:39,498 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:09:39,498 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:09:39,498 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:09:39,498 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:09:39,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:09:39,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:09:39,499 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:09:39,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:09:39,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:09:39,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:09:39,499 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:09:39,500 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:09:39,500 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:09:39,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:09:39,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:09:39,500 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:09:39,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:09:39,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:09:39,501 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:09:39,501 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:09:39,502 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a398041f87cd84898ae142142fdf4872d746c3b1 [2018-11-18 12:09:39,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:09:39,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:09:39,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:09:39,537 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:09:39,538 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:09:39,538 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:09:39,582 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/data/b3a93543a/587f334e556b480d83ef3a4cc02b04b4/FLAG1003157a6 [2018-11-18 12:09:40,019 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:09:40,019 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:09:40,026 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/data/b3a93543a/587f334e556b480d83ef3a4cc02b04b4/FLAG1003157a6 [2018-11-18 12:09:40,034 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/data/b3a93543a/587f334e556b480d83ef3a4cc02b04b4 [2018-11-18 12:09:40,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:09:40,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:09:40,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:09:40,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:09:40,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:09:40,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b29fef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40, skipping insertion in model container [2018-11-18 12:09:40,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:09:40,082 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:09:40,265 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:09:40,274 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:09:40,298 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:09:40,371 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:09:40,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40 WrapperNode [2018-11-18 12:09:40,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:09:40,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:09:40,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:09:40,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:09:40,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:09:40,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:09:40,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:09:40,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:09:40,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... [2018-11-18 12:09:40,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:09:40,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:09:40,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:09:40,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:09:40,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:09:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:09:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:09:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:09:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:09:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:09:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:09:40,607 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:09:40,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:09:40 BoogieIcfgContainer [2018-11-18 12:09:40,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:09:40,608 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:09:40,608 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:09:40,610 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:09:40,610 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:09:40,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:09:40" (1/3) ... [2018-11-18 12:09:40,611 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12c0a278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:09:40, skipping insertion in model container [2018-11-18 12:09:40,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:09:40,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:09:40" (2/3) ... [2018-11-18 12:09:40,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12c0a278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:09:40, skipping insertion in model container [2018-11-18 12:09:40,612 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:09:40,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:09:40" (3/3) ... [2018-11-18 12:09:40,613 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:09:40,655 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:09:40,655 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:09:40,656 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:09:40,656 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:09:40,656 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:09:40,656 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:09:40,656 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:09:40,656 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:09:40,656 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:09:40,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 12:09:40,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:40,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:09:40,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:09:40,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:09:40,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:09:40,686 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:09:40,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 12:09:40,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:40,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:09:40,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:09:40,688 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:09:40,688 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:09:40,694 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 10#L557-4true [2018-11-18 12:09:40,695 INFO L796 eck$LassoCheckResult]: Loop: 10#L557-4true assume true; 4#L557-1true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 7#L557-2true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 8#L558-4true assume !true; 11#L558-5true call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 10#L557-4true [2018-11-18 12:09:40,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:09:40,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:40,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:40,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:40,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:40,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 34421932, now seen corresponding path program 1 times [2018-11-18 12:09:40,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:40,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:40,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:09:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:09:40,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:09:40,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:09:40,837 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:09:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:09:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:09:40,847 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-18 12:09:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:09:40,852 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-18 12:09:40,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:09:40,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2018-11-18 12:09:40,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:40,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 10 transitions. [2018-11-18 12:09:40,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 12:09:40,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 12:09:40,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-18 12:09:40,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:09:40,858 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 12:09:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-18 12:09:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-18 12:09:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 12:09:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-18 12:09:40,881 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 12:09:40,882 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 12:09:40,882 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:09:40,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-18 12:09:40,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:40,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:09:40,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:09:40,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:09:40,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:09:40,883 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 37#L557-4 [2018-11-18 12:09:40,883 INFO L796 eck$LassoCheckResult]: Loop: 37#L557-4 assume true; 39#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 44#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 43#L558-4 assume true; 41#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 42#L558-2 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 38#L558-5 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 37#L557-4 [2018-11-18 12:09:40,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 12:09:40,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:40,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:40,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1280537774, now seen corresponding path program 1 times [2018-11-18 12:09:40,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:09:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:40,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash 265759056, now seen corresponding path program 1 times [2018-11-18 12:09:40,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:40,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:41,429 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-18 12:09:41,563 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-18 12:09:41,572 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:09:41,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:09:41,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:09:41,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:09:41,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:09:41,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:09:41,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:09:41,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:09:41,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-18 12:09:41,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:09:41,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:09:41,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:41,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:41,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:41,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:41,908 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-18 12:09:42,061 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-11-18 12:09:42,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:42,386 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:09:42,389 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:09:42,390 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 [2018-11-18 12:09:42,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:42,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:42,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:42,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,396 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 [2018-11-18 12:09:42,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:42,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:42,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:42,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,399 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 [2018-11-18 12:09:42,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,407 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 [2018-11-18 12:09:42,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,413 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 [2018-11-18 12:09:42,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,418 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 [2018-11-18 12:09:42,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,419 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:09:42,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,421 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:09:42,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,432 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 [2018-11-18 12:09:42,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,445 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 [2018-11-18 12:09:42,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,476 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 [2018-11-18 12:09:42,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,477 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:09:42,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:09:42,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,483 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 [2018-11-18 12:09:42,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,489 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 [2018-11-18 12:09:42,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,490 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:09:42,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,491 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:09:42,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,496 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 [2018-11-18 12:09:42,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,498 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:09:42,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,499 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:09:42,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,503 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 [2018-11-18 12:09:42,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,509 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 [2018-11-18 12:09:42,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,516 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 [2018-11-18 12:09:42,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,523 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 [2018-11-18 12:09:42,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:42,529 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 [2018-11-18 12:09:42,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:42,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:42,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:42,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:42,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:42,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:42,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:09:42,561 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:09:42,561 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:09:42,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:09:42,563 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:09:42,563 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:09:42,564 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-18 12:09:42,694 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-18 12:09:42,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:09:42,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:09:42,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:09:42,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:09:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:09:42,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:09:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:09:42,853 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-18 12:09:42,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-11-18 12:09:42,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 7 states. Result 23 states and 26 transitions. Complement of second has 13 states. [2018-11-18 12:09:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 12:09:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 12:09:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-18 12:09:42,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-18 12:09:42,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:42,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-18 12:09:42,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:42,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-18 12:09:42,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:42,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-18 12:09:42,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:42,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 25 transitions. [2018-11-18 12:09:42,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:09:42,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 12:09:42,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-11-18 12:09:42,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:09:42,980 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 12:09:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-11-18 12:09:42,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 12:09:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 12:09:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-18 12:09:42,981 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 12:09:42,981 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 12:09:42,981 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:09:42,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-18 12:09:42,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:42,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:09:42,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:09:42,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:09:42,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:09:42,983 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 282#L557-4 assume true; 289#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 296#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 298#L558-4 assume true; 291#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 292#L558-2 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 295#L558-4 [2018-11-18 12:09:42,983 INFO L796 eck$LassoCheckResult]: Loop: 295#L558-4 assume true; 301#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 300#L558-2 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 295#L558-4 [2018-11-18 12:09:42,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash 147120206, now seen corresponding path program 1 times [2018-11-18 12:09:42,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:42,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:42,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:43,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash 46741, now seen corresponding path program 1 times [2018-11-18 12:09:43,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:43,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:43,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1991431976, now seen corresponding path program 2 times [2018-11-18 12:09:43,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:43,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:43,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:43,501 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 121 [2018-11-18 12:09:43,656 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-18 12:09:43,658 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:09:43,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:09:43,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:09:43,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:09:43,658 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:09:43,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:09:43,658 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:09:43,658 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:09:43,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-18 12:09:43,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:09:43,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:09:43,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,927 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-11-18 12:09:43,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:43,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:44,254 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:09:44,255 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:09:44,255 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 [2018-11-18 12:09:44,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:44,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:44,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:44,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,257 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 [2018-11-18 12:09:44,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:44,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:44,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:44,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,259 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 [2018-11-18 12:09:44,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,261 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 [2018-11-18 12:09:44,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,264 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 [2018-11-18 12:09:44,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,264 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:09:44,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,265 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:09:44,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,270 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 [2018-11-18 12:09:44,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,273 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 [2018-11-18 12:09:44,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,278 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 [2018-11-18 12:09:44,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,278 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:09:44,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,279 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:09:44,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,281 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 [2018-11-18 12:09:44,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,283 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 [2018-11-18 12:09:44,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,287 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 [2018-11-18 12:09:44,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,289 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 [2018-11-18 12:09:44,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,292 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 [2018-11-18 12:09:44,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:44,295 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 [2018-11-18 12:09:44,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:44,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:44,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:44,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:44,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:44,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:44,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:09:44,316 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:09:44,316 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:09:44,316 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:09:44,317 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:09:44,318 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:09:44,318 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-18 12:09:44,406 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-11-18 12:09:44,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:09:44,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:09:44,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:09:44,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:09:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:09:44,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:09:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:09:44,461 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:09:44,461 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 12:09:44,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-11-18 12:09:44,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:09:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:09:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 12:09:44,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 12:09:44,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:44,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 12:09:44,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:44,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 12:09:44,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:44,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-18 12:09:44,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:44,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 34 transitions. [2018-11-18 12:09:44,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 12:09:44,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 12:09:44,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2018-11-18 12:09:44,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:09:44,482 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-18 12:09:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2018-11-18 12:09:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-18 12:09:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 12:09:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-18 12:09:44,484 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-18 12:09:44,484 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-18 12:09:44,484 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:09:44,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-18 12:09:44,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:44,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:09:44,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:09:44,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:09:44,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:09:44,487 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 518#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 519#L557-4 assume true; 526#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 532#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 535#L558-4 assume true; 543#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 542#L558-2 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 541#L558-4 assume true; 528#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 529#L558-2 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 520#L558-5 [2018-11-18 12:09:44,487 INFO L796 eck$LassoCheckResult]: Loop: 520#L558-5 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 521#L557-4 assume true; 524#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 545#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 537#L558-4 assume true; 538#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 544#L558-2 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 520#L558-5 [2018-11-18 12:09:44,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1991431974, now seen corresponding path program 1 times [2018-11-18 12:09:44,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:44,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:44,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:09:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:44,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:44,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1002676932, now seen corresponding path program 2 times [2018-11-18 12:09:44,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:44,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:44,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:44,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1493985279, now seen corresponding path program 1 times [2018-11-18 12:09:44,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:44,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:44,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:44,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:09:44,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:45,141 WARN L180 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2018-11-18 12:09:45,385 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-18 12:09:45,387 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:09:45,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:09:45,387 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:09:45,388 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:09:45,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:09:45,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:09:45,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:09:45,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:09:45,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-18 12:09:45,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:09:45,388 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:09:45,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:45,745 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2018-11-18 12:09:45,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:09:46,163 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:09:46,164 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:09:46,164 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 [2018-11-18 12:09:46,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,166 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 [2018-11-18 12:09:46,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:46,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,174 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 [2018-11-18 12:09:46,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,175 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 [2018-11-18 12:09:46,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,177 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 [2018-11-18 12:09:46,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,178 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 [2018-11-18 12:09:46,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:46,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,181 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 [2018-11-18 12:09:46,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,182 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 [2018-11-18 12:09:46,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,184 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 [2018-11-18 12:09:46,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:46,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,186 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 [2018-11-18 12:09:46,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,187 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 [2018-11-18 12:09:46,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,189 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 [2018-11-18 12:09:46,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:46,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,191 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 [2018-11-18 12:09:46,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,193 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 [2018-11-18 12:09:46,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:09:46,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:09:46,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:09:46,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,194 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 [2018-11-18 12:09:46,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,194 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:09:46,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,195 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:09:46,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,198 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 [2018-11-18 12:09:46,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:46,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,202 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 [2018-11-18 12:09:46,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:46,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,204 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 [2018-11-18 12:09:46,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,205 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:09:46,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:09:46,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:09:46,208 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 [2018-11-18 12:09:46,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:09:46,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:09:46,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:09:46,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:09:46,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:09:46,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:09:46,225 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:09:46,235 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:09:46,235 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:09:46,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:09:46,236 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:09:46,236 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:09:46,236 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-11-18 12:09:46,345 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-18 12:09:46,346 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:09:46,346 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:09:46,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:09:46,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:09:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:09:46,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:09:46,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-18 12:09:46,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-11-18 12:09:46,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 12:09:46,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 25 [2018-11-18 12:09:46,450 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:09:46,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:09:46,462 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:26 [2018-11-18 12:09:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:09:46,493 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 12:09:46,493 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 12:09:46,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 70 states and 80 transitions. Complement of second has 9 states. [2018-11-18 12:09:46,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 12:09:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:09:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-18 12:09:46,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-18 12:09:46,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:46,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-18 12:09:46,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:46,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 14 letters. [2018-11-18 12:09:46,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:09:46,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2018-11-18 12:09:46,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:46,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 55 states and 63 transitions. [2018-11-18 12:09:46,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-18 12:09:46,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-18 12:09:46,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-11-18 12:09:46,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:09:46,524 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-18 12:09:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-11-18 12:09:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-11-18 12:09:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 12:09:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-11-18 12:09:46,527 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-18 12:09:46,527 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-18 12:09:46,527 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:09:46,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2018-11-18 12:09:46,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:09:46,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:09:46,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:09:46,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 12:09:46,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:09:46,532 INFO L794 eck$LassoCheckResult]: Stem: 872#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 864#L557-4 assume true; 899#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 898#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 897#L558-4 assume true; 896#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 895#L558-2 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 893#L558-4 assume true; 890#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 888#L558-2 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 869#L558-5 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 867#L557-4 assume true; 868#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 905#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 904#L558-4 assume true; 873#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 874#L558-2 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 881#L558-4 [2018-11-18 12:09:46,532 INFO L796 eck$LassoCheckResult]: Loop: 881#L558-4 assume true; 885#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 900#L558-2 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 881#L558-4 [2018-11-18 12:09:46,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1493985281, now seen corresponding path program 2 times [2018-11-18 12:09:46,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:46,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:46,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:46,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:09:46,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:09:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:09:46,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:09:46,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f4bfde5-8227-4bfa-a950-6c94e9f79b61/bin-2019/uautomizer/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 [2018-11-18 12:09:46,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:09:46,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:09:46,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:09:46,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:09:46,776 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-18 12:09:46,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-11-18 12:09:46,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-18 12:09:46,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,846 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2018-11-18 12:09:46,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-11-18 12:09:46,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 16 [2018-11-18 12:09:46,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-18 12:09:46,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-11-18 12:09:46,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:09:46,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 16 [2018-11-18 12:09:46,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-11-18 12:09:46,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-18 12:09:46,926 INFO L477 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 13 treesize of output 9 [2018-11-18 12:09:46,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,930 INFO L477 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 11 treesize of output 7 [2018-11-18 12:09:46,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:09:46,933 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-11-18 12:09:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:09:46,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:09:46,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-11-18 12:09:46,956 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:09:46,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:09:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash 46741, now seen corresponding path program 2 times [2018-11-18 12:09:46,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:09:46,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:09:46,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:46,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:09:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:09:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:09:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:09:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:09:46,987 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 13 Second operand 14 states. [2018-11-18 12:09:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:09:47,106 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-18 12:09:47,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:09:47,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 44 transitions. [2018-11-18 12:09:47,107 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:09:47,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-18 12:09:47,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:09:47,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:09:47,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:09:47,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:09:47,108 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:09:47,108 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:09:47,108 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:09:47,108 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:09:47,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:09:47,108 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:09:47,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:09:47,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:09:47 BoogieIcfgContainer [2018-11-18 12:09:47,113 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:09:47,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:09:47,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:09:47,114 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:09:47,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:09:40" (3/4) ... [2018-11-18 12:09:47,116 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:09:47,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:09:47,117 INFO L168 Benchmark]: Toolchain (without parser) took 7080.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 957.6 MB in the beginning and 887.1 MB in the end (delta: 70.5 MB). Peak memory consumption was 291.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:09:47,118 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:09:47,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:09:47,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:09:47,119 INFO L168 Benchmark]: Boogie Preprocessor took 14.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:09:47,119 INFO L168 Benchmark]: RCFGBuilder took 193.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:09:47,119 INFO L168 Benchmark]: BuchiAutomizer took 6505.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 887.1 MB in the end (delta: 223.9 MB). Peak memory consumption was 297.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:09:47,120 INFO L168 Benchmark]: Witness Printer took 3.16 ms. Allocated memory is still 1.3 GB. Free memory is still 887.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:09:47,122 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6505.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 887.1 MB in the end (delta: 223.9 MB). Peak memory consumption was 297.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.16 ms. Allocated memory is still 1.3 GB. Free memory is still 887.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 5.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 41 SDslu, 55 SDs, 0 SdLazy, 105 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital876 mio100 ax102 hnf100 lsp96 ukn31 mio100 lsp33 div100 bol100 ite100 ukn100 eq194 hnf87 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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! Received shutdown request...