./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/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_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/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-aa41828 [2018-11-23 05:50:52,418 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:50:52,420 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:50:52,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:50:52,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:50:52,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:50:52,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:50:52,428 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:50:52,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:50:52,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:50:52,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:50:52,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:50:52,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:50:52,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:50:52,433 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:50:52,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:50:52,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:50:52,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:50:52,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:50:52,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:50:52,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:50:52,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:50:52,441 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:50:52,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:50:52,441 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:50:52,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:50:52,442 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:50:52,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:50:52,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:50:52,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:50:52,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:50:52,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:50:52,444 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:50:52,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:50:52,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:50:52,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:50:52,445 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:50:52,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:50:52,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:50:52,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:50:52,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:50:52,456 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:50:52,456 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:50:52,456 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:50:52,456 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:50:52,456 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:50:52,456 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:50:52,456 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:50:52,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:50:52,457 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:50:52,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:50:52,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:50:52,457 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:50:52,457 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:50:52,457 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:50:52,457 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:50:52,457 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:50:52,459 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:50:52,459 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:50:52,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:50:52,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:50:52,460 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:50:52,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:50:52,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:50:52,460 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:50:52,461 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:50:52,461 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_38ec7390-45bc-4ad2-be87-3bda83ba62db/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-23 05:50:52,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:50:52,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:50:52,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:50:52,497 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:50:52,498 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:50:52,498 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-23 05:50:52,538 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/data/22825b6fb/62e4f8a3efe8444396b744f7069d5758/FLAG8c154d6ef [2018-11-23 05:50:53,001 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:50:53,002 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-23 05:50:53,011 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/data/22825b6fb/62e4f8a3efe8444396b744f7069d5758/FLAG8c154d6ef [2018-11-23 05:50:53,023 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/bin-2019/uautomizer/data/22825b6fb/62e4f8a3efe8444396b744f7069d5758 [2018-11-23 05:50:53,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:50:53,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:50:53,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:50:53,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:50:53,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:50:53,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bab14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53, skipping insertion in model container [2018-11-23 05:50:53,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:50:53,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:50:53,252 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:50:53,260 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:50:53,325 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:50:53,353 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:50:53,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53 WrapperNode [2018-11-23 05:50:53,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:50:53,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:50:53,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:50:53,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:50:53,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:50:53,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:50:53,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:50:53,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:50:53,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... [2018-11-23 05:50:53,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:50:53,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:50:53,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:50:53,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:50:53,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/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-23 05:50:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:50:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:50:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:50:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:50:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:50:53,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:50:53,592 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:50:53,592 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 05:50:53,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:50:53 BoogieIcfgContainer [2018-11-23 05:50:53,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:50:53,593 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:50:53,593 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:50:53,595 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:50:53,596 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:50:53,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:50:53" (1/3) ... [2018-11-23 05:50:53,597 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bbe605a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:50:53, skipping insertion in model container [2018-11-23 05:50:53,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:50:53,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:50:53" (2/3) ... [2018-11-23 05:50:53,597 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bbe605a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:50:53, skipping insertion in model container [2018-11-23 05:50:53,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:50:53,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:50:53" (3/3) ... [2018-11-23 05:50:53,598 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-23 05:50:53,634 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:50:53,634 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:50:53,634 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:50:53,634 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:50:53,634 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:50:53,634 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:50:53,635 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:50:53,635 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:50:53,635 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:50:53,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 05:50:53,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:53,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:50:53,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:50:53,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 05:50:53,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:50:53,665 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:50:53,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 05:50:53,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:53,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:50:53,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:50:53,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 05:50:53,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:50:53,673 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;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); 13#L557-3true [2018-11-23 05:50:53,673 INFO L796 eck$LassoCheckResult]: Loop: 13#L557-3true 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); 8#L557-1true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 11#L558-3true assume !true; 14#L558-4true 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; 13#L557-3true [2018-11-23 05:50:53,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 05:50:53,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:53,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:53,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:53,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-11-23 05:50:53,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:53,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:53,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:53,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:53,811 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-23 05:50:53,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:50:53,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:50:53,814 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 05:50:53,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:50:53,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:50:53,825 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-23 05:50:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:50:53,829 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 05:50:53,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:50:53,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-23 05:50:53,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:53,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-11-23 05:50:53,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 05:50:53,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 05:50:53,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-23 05:50:53,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:50:53,836 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 05:50:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-23 05:50:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 05:50:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 05:50:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-23 05:50:53,856 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 05:50:53,856 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 05:50:53,857 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:50:53,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-23 05:50:53,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:53,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:50:53,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:50:53,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 05:50:53,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:50:53,858 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;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); 33#L557-3 [2018-11-23 05:50:53,858 INFO L796 eck$LassoCheckResult]: Loop: 33#L557-3 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); 38#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 37#L558-3 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); 35#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 36#L558-4 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; 33#L557-3 [2018-11-23 05:50:53,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 05:50:53,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:53,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:53,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:53,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:53,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-11-23 05:50:53,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:53,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:50:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:53,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:53,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-11-23 05:50:53,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:53,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:53,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:53,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:54,401 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-23 05:50:54,545 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-23 05:50:54,554 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:50:54,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:50:54,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:50:54,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:50:54,555 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:50:54,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:50:54,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:50:54,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:50:54,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-23 05:50:54,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:50:54,556 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:50:54,574 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-23 05:50:54,578 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-23 05:50:54,579 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-23 05:50:54,582 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-23 05:50:54,906 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-23 05:50:55,013 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-23 05:50:55,014 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-23 05:50:55,016 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-23 05:50:55,018 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-23 05:50:55,020 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-23 05:50:55,022 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-23 05:50:55,024 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-23 05:50:55,027 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-23 05:50:55,029 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-23 05:50:55,031 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-23 05:50:55,033 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-23 05:50:55,036 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-23 05:50:55,038 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-23 05:50:55,366 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:50:55,369 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:50:55,370 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-23 05:50:55,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:55,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:55,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:55,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,374 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-23 05:50:55,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:55,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:55,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:55,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,377 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-23 05:50:55,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,381 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-23 05:50:55,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,385 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-23 05:50:55,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,391 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-23 05:50:55,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,392 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:50:55,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,394 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:50:55,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,403 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-23 05:50:55,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,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-23 05:50:55,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,441 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-23 05:50:55,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,442 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:50:55,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,443 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:50:55,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,449 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-23 05:50:55,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,453 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-23 05:50:55,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,454 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:50:55,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,455 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:50:55,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,460 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-23 05:50:55,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,460 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:50:55,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,462 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:50:55,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,465 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-23 05:50:55,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,470 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-23 05:50:55,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,473 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-23 05:50:55,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,479 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-23 05:50:55,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:55,486 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-23 05:50:55,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:55,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:55,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:55,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:55,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:55,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:55,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:50:55,514 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 05:50:55,515 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 05:50:55,516 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:50:55,517 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:50:55,517 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:50:55,518 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-23 05:50:55,615 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-23 05:50:55,619 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:50:55,620 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:50:55,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:55,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:50:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:55,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:50:55,727 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-23 05:50:55,729 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-23 05:50:55,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-23 05:50:55,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 17 states and 20 transitions. Complement of second has 11 states. [2018-11-23 05:50:55,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 05:50:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 05:50:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-23 05:50:55,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-23 05:50:55,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:55,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 05:50:55,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:55,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-23 05:50:55,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:55,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-23 05:50:55,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:55,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2018-11-23 05:50:55,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 05:50:55,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 05:50:55,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-23 05:50:55,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:50:55,816 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 05:50:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-23 05:50:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 05:50:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 05:50:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-23 05:50:55,817 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 05:50:55,817 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 05:50:55,817 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:50:55,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-23 05:50:55,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:55,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:50:55,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:50:55,818 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 05:50:55,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:50:55,819 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;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); 261#L557-3 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); 274#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 275#L558-3 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); 263#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;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; 264#L558-3 [2018-11-23 05:50:55,819 INFO L796 eck$LassoCheckResult]: Loop: 264#L558-3 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); 270#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;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; 264#L558-3 [2018-11-23 05:50:55,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-23 05:50:55,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:55,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:55,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:55,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:55,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:55,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2018-11-23 05:50:55,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:55,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:55,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:55,848 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2018-11-23 05:50:55,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:55,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:55,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:55,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:56,331 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 121 [2018-11-23 05:50:56,492 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 05:50:56,495 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:50:56,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:50:56,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:50:56,495 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:50:56,495 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:50:56,495 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:50:56,495 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:50:56,495 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:50:56,495 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-23 05:50:56,495 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:50:56,495 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:50:56,499 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-23 05:50:56,500 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-23 05:50:56,501 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-23 05:50:56,503 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-23 05:50:56,751 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-11-23 05:50:56,804 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-23 05:50:56,806 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-23 05:50:56,807 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-23 05:50:56,808 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-23 05:50:56,809 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-23 05:50:56,810 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-23 05:50:56,810 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-23 05:50:56,812 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-23 05:50:56,812 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-23 05:50:56,815 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-23 05:50:56,817 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-23 05:50:56,818 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-23 05:50:57,097 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:50:57,097 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:50:57,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:50:57,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:57,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:57,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:57,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,099 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-23 05:50:57,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:57,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:57,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:57,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,102 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-23 05:50:57,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,105 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-23 05:50:57,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,107 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-23 05:50:57,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,108 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:50:57,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,109 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:50:57,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,111 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-23 05:50:57,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,114 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-23 05:50:57,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,118 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-23 05:50:57,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,119 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:50:57,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,119 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:50:57,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,122 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-23 05:50:57,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,125 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-23 05:50:57,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,128 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-23 05:50:57,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,131 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-23 05:50:57,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,134 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-23 05:50:57,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:57,137 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-23 05:50:57,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:57,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:57,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:57,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:57,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:57,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:57,150 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:50:57,158 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 05:50:57,158 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 05:50:57,159 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:50:57,159 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:50:57,159 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:50:57,160 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-23 05:50:57,231 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-11-23 05:50:57,232 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:50:57,232 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:50:57,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:57,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:50:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:57,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:50:57,277 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-23 05:50:57,277 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-23 05:50:57,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 05:50:57,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2018-11-23 05:50:57,291 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-23 05:50:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:50:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 05:50:57,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 05:50:57,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:57,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 05:50:57,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:57,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 05:50:57,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:57,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-23 05:50:57,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:57,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2018-11-23 05:50:57,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 05:50:57,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 05:50:57,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-11-23 05:50:57,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:50:57,295 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-23 05:50:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-11-23 05:50:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 05:50:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 05:50:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-23 05:50:57,297 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 05:50:57,297 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 05:50:57,297 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:50:57,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-23 05:50:57,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:57,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:50:57,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:50:57,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 05:50:57,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:50:57,298 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 474#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;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); 475#L557-3 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); 489#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 493#L558-3 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); 492#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;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; 491#L558-3 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); 477#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 478#L558-4 [2018-11-23 05:50:57,298 INFO L796 eck$LassoCheckResult]: Loop: 478#L558-4 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; 486#L557-3 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); 481#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 482#L558-3 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); 485#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 478#L558-4 [2018-11-23 05:50:57,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2018-11-23 05:50:57,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:57,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:57,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:50:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:57,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2018-11-23 05:50:57,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:57,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:57,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:57,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:57,325 INFO L82 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2018-11-23 05:50:57,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:57,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:57,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:57,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:50:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:50:58,152 WARN L180 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2018-11-23 05:50:58,389 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-23 05:50:58,391 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:50:58,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:50:58,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:50:58,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:50:58,391 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:50:58,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:50:58,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:50:58,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:50:58,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-23 05:50:58,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:50:58,391 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:50:58,393 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-23 05:50:58,394 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-23 05:50:58,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-23 05:50:58,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-23 05:50:58,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-23 05:50:58,400 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-23 05:50:58,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-23 05:50:58,402 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-23 05:50:58,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-23 05:50:58,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-23 05:50:58,406 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-23 05:50:58,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-23 05:50:58,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-23 05:50:58,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-23 05:50:58,410 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-23 05:50:58,741 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2018-11-23 05:50:58,813 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-23 05:50:59,153 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:50:59,154 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:50:59,154 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-23 05:50:59,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,157 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-23 05:50:59,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:59,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,159 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-23 05:50:59,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,160 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-23 05:50:59,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,162 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-23 05:50:59,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,163 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-23 05:50:59,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:59,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,165 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-23 05:50:59,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,167 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-23 05:50:59,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,168 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-23 05:50:59,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:59,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,170 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-23 05:50:59,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,172 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-23 05:50:59,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,173 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-23 05:50:59,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:59,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,176 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-23 05:50:59,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,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-23 05:50:59,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:50:59,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:50:59,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:50:59,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,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-23 05:50:59,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,179 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:50:59,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,180 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:50:59,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,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-23 05:50:59,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:59,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,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-23 05:50:59,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:59,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,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-23 05:50:59,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,189 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:50:59,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,190 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:50:59,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:50:59,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-23 05:50:59,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:50:59,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:50:59,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:50:59,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:50:59,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:50:59,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:50:59,210 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:50:59,221 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 05:50:59,221 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 05:50:59,221 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:50:59,222 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:50:59,222 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:50:59,222 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-23 05:50:59,342 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-23 05:50:59,343 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:50:59,343 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:50:59,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:59,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:50:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:59,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:50:59,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:50:59,411 INFO L478 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-23 05:50:59,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:50:59,449 INFO L478 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-23 05:50:59,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-23 05:50:59,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:50:59,481 INFO L478 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-23 05:50:59,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:50:59,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:50:59,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:50:59,498 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:26 [2018-11-23 05:50:59,543 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-23 05:50:59,543 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-23 05:50:59,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 05:50:59,581 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 58 transitions. Complement of second has 9 states. [2018-11-23 05:50:59,582 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-23 05:50:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 05:50:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-23 05:50:59,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-23 05:50:59,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:59,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-23 05:50:59,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:59,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-23 05:50:59,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:50:59,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2018-11-23 05:50:59,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:59,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 46 transitions. [2018-11-23 05:50:59,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 05:50:59,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:50:59,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2018-11-23 05:50:59,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:50:59,586 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 05:50:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2018-11-23 05:50:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-23 05:50:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 05:50:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-23 05:50:59,590 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 05:50:59,590 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 05:50:59,590 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 05:50:59,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-23 05:50:59,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:50:59,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:50:59,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:50:59,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 05:50:59,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:50:59,591 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 774#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;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); 775#L557-3 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); 783#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 784#L558-3 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); 779#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 780#L558-4 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; 790#L557-3 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); 781#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 782#L558-3 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); 777#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;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; 778#L558-3 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); 791#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 792#L558-4 [2018-11-23 05:50:59,591 INFO L796 eck$LassoCheckResult]: Loop: 792#L558-4 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; 785#L557-3 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); 786#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 800#L558-3 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); 801#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 792#L558-4 [2018-11-23 05:50:59,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:50:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash -652525668, now seen corresponding path program 2 times [2018-11-23 05:50:59,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:50:59,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:50:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:59,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:50:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:50:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:50:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:50:59,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:50:59,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ec7390-45bc-4ad2-be87-3bda83ba62db/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-23 05:50:59,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:50:59,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:50:59,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:50:59,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:50:59,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:50:59,876 INFO L478 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 17 treesize of output 29 [2018-11-23 05:50:59,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:50:59,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:50:59,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 05:50:59,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:50:59,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:50:59,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:50:59,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-23 05:50:59,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:50:59,976 INFO L478 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-23 05:50:59,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:50:59,979 INFO L478 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-23 05:50:59,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:50:59,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:50:59,992 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-23 05:50:59,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-11-23 05:50:59,998 INFO L478 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-23 05:51:00,002 INFO L478 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-23 05:51:00,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:51:00,019 INFO L478 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-23 05:51:00,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:51:00,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:51:00,032 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-23 05:51:00,033 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-11-23 05:51:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:00,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:51:00,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2018-11-23 05:51:00,077 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:51:00,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 3 times [2018-11-23 05:51:00,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:51:00,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:51:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:00,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:51:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:51:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 05:51:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:51:00,137 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 14 states. [2018-11-23 05:51:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:51:00,280 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 05:51:00,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:51:00,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-11-23 05:51:00,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:51:00,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-23 05:51:00,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:51:00,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:51:00,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:51:00,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:51:00,281 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:51:00,281 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:51:00,281 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:51:00,281 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 05:51:00,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:51:00,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:51:00,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:51:00,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:51:00 BoogieIcfgContainer [2018-11-23 05:51:00,285 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:51:00,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:51:00,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:51:00,285 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:51:00,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:50:53" (3/4) ... [2018-11-23 05:51:00,288 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:51:00,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:51:00,288 INFO L168 Benchmark]: Toolchain (without parser) took 7262.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 957.6 MB in the beginning and 919.0 MB in the end (delta: 38.6 MB). Peak memory consumption was 264.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:00,289 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:51:00,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:00,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.11 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-23 05:51:00,290 INFO L168 Benchmark]: Boogie Preprocessor took 16.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:51:00,290 INFO L168 Benchmark]: RCFGBuilder took 195.17 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:00,290 INFO L168 Benchmark]: BuchiAutomizer took 6691.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 919.0 MB in the end (delta: 179.6 MB). Peak memory consumption was 272.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:00,290 INFO L168 Benchmark]: Witness Printer took 2.55 ms. Allocated memory is still 1.3 GB. Free memory is still 919.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:51:00,292 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.11 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. * Boogie Preprocessor took 16.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.17 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6691.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 919.0 MB in the end (delta: 179.6 MB). Peak memory consumption was 272.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.55 ms. Allocated memory is still 1.3 GB. Free memory is still 919.0 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 6 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.6s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 5.9s. 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 25 SDslu, 10 SDs, 0 SdLazy, 127 SolverSat, 21 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: 11ms 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...