./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/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 9016787135830d25851d4a1126db5f65005e4eb5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:09:47,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:47,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:47,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:47,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:47,527 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:47,528 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:47,530 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:47,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:47,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:47,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:47,537 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:47,538 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:47,540 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:47,547 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:47,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:47,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:47,549 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:47,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:47,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:47,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:47,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:47,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:47,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:47,557 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:47,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:47,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:47,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:47,560 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:47,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:47,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:47,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:47,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:47,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:47,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:47,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:47,571 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:09:47,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:47,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:47,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:47,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:47,589 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:47,589 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:47,589 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:47,589 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:47,589 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:47,590 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:47,590 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:47,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:47,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:47,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:47,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:47,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:47,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:47,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:47,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:47,591 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:47,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:47,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:47,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:47,592 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:47,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:47,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:47,595 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:47,596 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:47,596 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_99222bc1-0135-4ff8-8069-33e2965aa18b/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 -> 9016787135830d25851d4a1126db5f65005e4eb5 [2018-10-27 06:09:47,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:47,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:47,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:47,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:47,645 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:47,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i [2018-10-27 06:09:47,695 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/data/06a6014d5/a7dbd377b6b24e4fb3449ea449da8a80/FLAG32b80c485 [2018-10-27 06:09:48,112 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:48,112 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i [2018-10-27 06:09:48,122 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/data/06a6014d5/a7dbd377b6b24e4fb3449ea449da8a80/FLAG32b80c485 [2018-10-27 06:09:48,134 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/bin-2019/uautomizer/data/06a6014d5/a7dbd377b6b24e4fb3449ea449da8a80 [2018-10-27 06:09:48,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:48,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:48,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:48,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:48,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:48,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c713e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48, skipping insertion in model container [2018-10-27 06:09:48,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:48,186 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:48,415 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:48,424 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:48,461 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:48,508 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:48,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48 WrapperNode [2018-10-27 06:09:48,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:48,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:48,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:48,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:48,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:48,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:48,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:48,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:48,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... [2018-10-27 06:09:48,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:48,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:48,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:48,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:48,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/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-10-27 06:09:48,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:09:48,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:09:48,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:48,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:49,133 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:49,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:49 BoogieIcfgContainer [2018-10-27 06:09:49,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:49,134 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:49,134 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:49,138 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:49,139 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:49,139 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:48" (1/3) ... [2018-10-27 06:09:49,140 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d4f81e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:49, skipping insertion in model container [2018-10-27 06:09:49,140 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:49,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:48" (2/3) ... [2018-10-27 06:09:49,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d4f81e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:49, skipping insertion in model container [2018-10-27 06:09:49,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:49,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:49" (3/3) ... [2018-10-27 06:09:49,142 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-termination.c.i [2018-10-27 06:09:49,190 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:49,191 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:49,191 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:49,191 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:49,191 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:49,191 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:49,191 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:49,192 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:49,192 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:49,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:09:49,225 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-10-27 06:09:49,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:49,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:49,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:49,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:49,232 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:49,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:09:49,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-10-27 06:09:49,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:49,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:49,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:49,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:49,241 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 24#L551true assume !(main_~length~0 < 1); 27#L551-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 22#L553true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 11#L554-3true [2018-10-27 06:09:49,242 INFO L795 eck$LassoCheckResult]: Loop: 11#L554-3true assume true; 8#L554-1true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 20#L556true assume main_~val~0 < 0;main_~val~0 := 0; 21#L556-2true SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L556-2 18#L559true main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 11#L554-3true [2018-10-27 06:09:49,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-10-27 06:09:49,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:49,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:49,352 INFO L82 PathProgramCache]: Analyzing trace with hash 45963670, now seen corresponding path program 1 times [2018-10-27 06:09:49,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:49,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1986381362, now seen corresponding path program 1 times [2018-10-27 06:09:49,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:49,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,562 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:09:49,963 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-27 06:09:50,092 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 06:09:50,101 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:50,102 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:50,102 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:50,103 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:50,103 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:50,103 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:50,103 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:50,103 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:50,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:09:50,103 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:50,104 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:50,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,483 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-10-27 06:09:50,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,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-10-27 06:09:50,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,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-10-27 06:09:50,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:50,883 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-27 06:09:51,156 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:51,160 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:51,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-10-27 06:09:51,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:51,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:51,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:51,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:51,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:51,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:51,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:51,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:51,171 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-10-27 06:09:51,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:51,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:51,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:51,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:51,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:51,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:51,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:51,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:51,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:51,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:51,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:51,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:51,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:51,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:51,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:51,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:51,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:51,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-10-27 06:09:51,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:51,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:51,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:51,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:51,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:51,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:51,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:51,190 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-10-27 06:09:51,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:51,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:51,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:51,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:51,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:51,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:51,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:51,199 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-10-27 06:09:51,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:51,199 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:51,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:51,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:51,202 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:51,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:51,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:51,219 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-10-27 06:09:51,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:51,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:51,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:51,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:51,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:51,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:51,320 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:51,363 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:09:51,363 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:09:51,366 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:51,367 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:51,367 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:51,368 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:51,438 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:09:51,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:51,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:51,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:51,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:51,570 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-10-27 06:09:51,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2018-10-27 06:09:51,656 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 63 states and 78 transitions. Complement of second has 7 states. [2018-10-27 06:09:51,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:09:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-10-27 06:09:51,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 5 letters. [2018-10-27 06:09:51,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:51,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 5 letters. [2018-10-27 06:09:51,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:51,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 10 letters. [2018-10-27 06:09:51,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:51,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 78 transitions. [2018-10-27 06:09:51,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:09:51,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 28 transitions. [2018-10-27 06:09:51,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:09:51,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:09:51,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-10-27 06:09:51,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:51,682 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-10-27 06:09:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-10-27 06:09:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:09:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:09:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-10-27 06:09:51,710 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-10-27 06:09:51,710 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-10-27 06:09:51,710 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:51,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-10-27 06:09:51,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:09:51,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:51,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:51,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:51,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:09:51,713 INFO L793 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 166#L551 assume !(main_~length~0 < 1); 176#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 170#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 171#L554-3 assume true; 167#L554-1 assume !(main_~i~0 < main_~length~0); 168#L554-4 main_~j~0 := 0; 158#L561-4 [2018-10-27 06:09:51,714 INFO L795 eck$LassoCheckResult]: Loop: 158#L561-4 assume true; 161#L561-1 assume !!(main_~j~0 < main_~length~0); 159#L562-4 assume true; 160#L562-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L562-1 178#L562-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 157#L561-3 main_#t~post6 := main_~j~0;main_~j~0 := main_#t~post6 + 1;havoc main_#t~post6; 158#L561-4 [2018-10-27 06:09:51,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash 176703704, now seen corresponding path program 1 times [2018-10-27 06:09:51,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:51,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:51,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:51,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:09:51,791 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:51,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2075738674, now seen corresponding path program 1 times [2018-10-27 06:09:51,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:51,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:51,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:51,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:09:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:09:51,856 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:09:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:51,907 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 06:09:51,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:09:51,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-10-27 06:09:51,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:09:51,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 32 transitions. [2018-10-27 06:09:51,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:09:51,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:09:51,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-10-27 06:09:51,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:51,910 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-10-27 06:09:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-10-27 06:09:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-10-27 06:09:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:09:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:09:51,912 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:09:51,913 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:09:51,913 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:51,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:09:51,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:09:51,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:51,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:51,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:51,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:09:51,915 INFO L793 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 224#L551 assume !(main_~length~0 < 1); 235#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 228#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 229#L554-3 assume true; 227#L554-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 220#L556 assume !(main_~val~0 < 0); 221#L556-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L556-2 222#L559 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 234#L554-3 assume true; 225#L554-1 assume !(main_~i~0 < main_~length~0); 226#L554-4 main_~j~0 := 0; 218#L561-4 [2018-10-27 06:09:51,915 INFO L795 eck$LassoCheckResult]: Loop: 218#L561-4 assume true; 219#L561-1 assume !!(main_~j~0 < main_~length~0); 215#L562-4 assume true; 216#L562-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L562-1 236#L562-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 217#L561-3 main_#t~post6 := main_~j~0;main_~j~0 := main_#t~post6 + 1;havoc main_#t~post6; 218#L561-4 [2018-10-27 06:09:51,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,915 INFO L82 PathProgramCache]: Analyzing trace with hash -170474767, now seen corresponding path program 1 times [2018-10-27 06:09:51,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:51,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:51,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2075738674, now seen corresponding path program 2 times [2018-10-27 06:09:51,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:51,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:51,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1238241570, now seen corresponding path program 1 times [2018-10-27 06:09:51,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:51,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:51,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:52,426 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-10-27 06:09:52,467 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:52,468 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:52,468 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:52,468 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:52,468 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:52,468 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:52,468 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:52,468 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:52,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:09:52,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:52,469 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:52,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,619 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-27 06:09:52,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:52,992 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:52,992 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:52,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:52,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:52,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:52,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:52,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:52,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:52,994 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-10-27 06:09:52,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:52,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:52,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:52,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:52,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:52,996 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-10-27 06:09:52,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:52,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:52,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:52,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:52,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:52,998 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-10-27 06:09:52,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:52,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:53,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:53,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:53,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:53,002 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-10-27 06:09:53,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:53,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:53,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:53,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:53,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:53,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:53,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:53,007 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-10-27 06:09:53,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:53,007 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:53,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:53,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:53,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:53,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:53,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:53,017 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-10-27 06:09:53,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:53,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:53,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:53,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:53,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:53,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:53,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:53,022 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-10-27 06:09:53,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:53,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:53,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:53,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:53,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:53,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:53,043 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:53,051 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:53,052 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:53,052 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:53,053 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:53,053 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:53,053 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-10-27 06:09:53,130 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:09:53,131 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:53,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:53,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:53,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:53,258 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-10-27 06:09:53,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-10-27 06:09:53,305 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 37 states and 43 transitions. Complement of second has 6 states. [2018-10-27 06:09:53,305 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-10-27 06:09:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:09:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-10-27 06:09:53,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 13 letters. Loop has 6 letters. [2018-10-27 06:09:53,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:53,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 19 letters. Loop has 6 letters. [2018-10-27 06:09:53,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:53,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 13 letters. Loop has 12 letters. [2018-10-27 06:09:53,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:53,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-10-27 06:09:53,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:53,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 42 transitions. [2018-10-27 06:09:53,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:09:53,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:09:53,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-10-27 06:09:53,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:53,309 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-27 06:09:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-10-27 06:09:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-10-27 06:09:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 06:09:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-10-27 06:09:53,311 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-10-27 06:09:53,311 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-10-27 06:09:53,311 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:09:53,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-10-27 06:09:53,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:53,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:53,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:53,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:53,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:53,313 INFO L793 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 379#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 380#L551 assume !(main_~length~0 < 1); 393#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 381#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 382#L554-3 assume true; 385#L554-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 376#L556 assume !(main_~val~0 < 0); 377#L556-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L556-2 378#L559 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 394#L554-3 assume true; 383#L554-1 assume !(main_~i~0 < main_~length~0); 384#L554-4 main_~j~0 := 0; 373#L561-4 assume true; 375#L561-1 assume !!(main_~j~0 < main_~length~0); 367#L562-4 [2018-10-27 06:09:53,313 INFO L795 eck$LassoCheckResult]: Loop: 367#L562-4 assume true; 368#L562-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L562-1 395#L562-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7; 387#L563 SUMMARY for call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L563 388#L563-1 main_#t~post9 := main_#t~mem8; 391#L563-2 SUMMARY for call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L563-2 397#L563-3 havoc main_#t~mem8;havoc main_#t~post9; 367#L562-4 [2018-10-27 06:09:53,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -617492554, now seen corresponding path program 1 times [2018-10-27 06:09:53,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:53,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,329 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 1 times [2018-10-27 06:09:53,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:53,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:53,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1017797342, now seen corresponding path program 1 times [2018-10-27 06:09:53,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:53,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,607 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-10-27 06:09:53,658 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:53,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:53,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:53,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:53,658 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:53,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:53,658 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:53,658 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:53,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:09:53,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:53,659 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:53,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:53,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-10-27 06:09:54,082 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:54,082 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:54,083 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-10-27 06:09:54,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:54,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:54,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:54,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:54,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:54,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:54,096 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:54,101 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:54,101 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:54,101 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:54,102 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:54,103 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:54,103 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2 Supporting invariants [] [2018-10-27 06:09:54,205 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:09:54,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:54,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:54,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:54,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:54,576 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:54,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:09:54,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-10-27 06:09:54,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:54,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:54,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:54,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:09:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:54,618 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:09:54,618 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-10-27 06:09:54,655 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 65 states and 74 transitions. Complement of second has 13 states. [2018-10-27 06:09:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-10-27 06:09:54,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 15 letters. Loop has 7 letters. [2018-10-27 06:09:54,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:54,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 22 letters. Loop has 7 letters. [2018-10-27 06:09:54,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:54,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 15 letters. Loop has 14 letters. [2018-10-27 06:09:54,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:54,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 74 transitions. [2018-10-27 06:09:54,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:54,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 45 states and 52 transitions. [2018-10-27 06:09:54,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:09:54,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-10-27 06:09:54,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 52 transitions. [2018-10-27 06:09:54,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:54,660 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-10-27 06:09:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 52 transitions. [2018-10-27 06:09:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-27 06:09:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 06:09:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-10-27 06:09:54,663 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-27 06:09:54,663 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-27 06:09:54,663 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:09:54,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-10-27 06:09:54,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:54,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:54,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:54,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:54,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:54,664 INFO L793 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 597#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 598#L551 assume !(main_~length~0 < 1); 611#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 599#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 600#L554-3 assume true; 603#L554-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 594#L556 assume !(main_~val~0 < 0); 595#L556-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L556-2 596#L559 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 612#L554-3 assume true; 601#L554-1 assume !(main_~i~0 < main_~length~0); 602#L554-4 main_~j~0 := 0; 590#L561-4 assume true; 591#L561-1 assume !!(main_~j~0 < main_~length~0); 617#L562-4 assume true; 587#L562-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L562-1 616#L562-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 588#L561-3 main_#t~post6 := main_~j~0;main_~j~0 := main_#t~post6 + 1;havoc main_#t~post6; 589#L561-4 assume true; 593#L561-1 assume !!(main_~j~0 < main_~length~0); 584#L562-4 [2018-10-27 06:09:54,664 INFO L795 eck$LassoCheckResult]: Loop: 584#L562-4 assume true; 585#L562-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L562-1 615#L562-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7; 604#L563 SUMMARY for call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L563 605#L563-1 main_#t~post9 := main_#t~mem8; 609#L563-2 SUMMARY for call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L563-2 613#L563-3 havoc main_#t~mem8;havoc main_#t~post9; 584#L562-4 [2018-10-27 06:09:54,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash 244209063, now seen corresponding path program 2 times [2018-10-27 06:09:54,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:54,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:54,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:54,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:54,908 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99222bc1-0135-4ff8-8069-33e2965aa18b/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-10-27 06:09:54,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:09:54,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:09:54,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:54,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:55,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:55,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-10-27 06:09:55,027 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:55,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 2 times [2018-10-27 06:09:55,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:55,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:55,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:55,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:55,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:55,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 06:09:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-27 06:09:55,078 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 14 states. [2018-10-27 06:09:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:55,276 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-10-27 06:09:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:09:55,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2018-10-27 06:09:55,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:55,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 53 states and 61 transitions. [2018-10-27 06:09:55,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:09:55,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-10-27 06:09:55,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 61 transitions. [2018-10-27 06:09:55,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:55,280 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-10-27 06:09:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 61 transitions. [2018-10-27 06:09:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-10-27 06:09:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-27 06:09:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-10-27 06:09:55,284 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-10-27 06:09:55,284 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-10-27 06:09:55,284 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:09:55,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2018-10-27 06:09:55,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:55,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:55,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:55,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:55,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:55,285 INFO L793 eck$LassoCheckResult]: Stem: 831#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 820#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 821#L551 assume !(main_~length~0 < 1); 834#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 822#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 823#L554-3 assume true; 835#L554-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 850#L556 assume !(main_~val~0 < 0); 849#L556-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L556-2 847#L559 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 836#L554-3 assume true; 826#L554-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 817#L556 assume !(main_~val~0 < 0); 818#L556-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L556-2 819#L559 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 848#L554-3 assume true; 824#L554-1 assume !(main_~i~0 < main_~length~0); 825#L554-4 main_~j~0 := 0; 813#L561-4 assume true; 814#L561-1 assume !!(main_~j~0 < main_~length~0); 842#L562-4 assume true; 810#L562-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L562-1 838#L562-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 811#L561-3 main_#t~post6 := main_~j~0;main_~j~0 := main_#t~post6 + 1;havoc main_#t~post6; 812#L561-4 assume true; 816#L561-1 assume !!(main_~j~0 < main_~length~0); 807#L562-4 [2018-10-27 06:09:55,285 INFO L795 eck$LassoCheckResult]: Loop: 807#L562-4 assume true; 808#L562-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L562-1 837#L562-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7; 827#L563 SUMMARY for call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L563 828#L563-1 main_#t~post9 := main_#t~mem8; 832#L563-2 SUMMARY for call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L563-2 839#L563-3 havoc main_#t~mem8;havoc main_#t~post9; 807#L562-4 [2018-10-27 06:09:55,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:55,286 INFO L82 PathProgramCache]: Analyzing trace with hash 851364910, now seen corresponding path program 3 times [2018-10-27 06:09:55,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:55,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:55,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:55,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:55,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:55,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 3 times [2018-10-27 06:09:55,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:55,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:55,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:55,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1879191978, now seen corresponding path program 1 times [2018-10-27 06:09:55,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:55,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:55,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:55,626 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2018-10-27 06:09:55,677 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:55,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:55,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:55,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:55,677 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:55,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:55,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:55,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:55,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:09:55,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:55,678 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:55,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,811 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-27 06:09:55,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:56,044 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:56,044 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:56,044 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-10-27 06:09:56,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,050 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-10-27 06:09:56,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,052 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-10-27 06:09:56,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,067 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-10-27 06:09:56,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,070 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-10-27 06:09:56,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,074 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-10-27 06:09:56,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,108 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-10-27 06:09:56,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,116 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-10-27 06:09:56,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,130 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-10-27 06:09:56,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:56,133 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:56,133 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:56,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:56,133 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:09:56,133 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:56,133 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_1 Supporting invariants [] [2018-10-27 06:09:56,251 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:09:56,265 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:56,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:56,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:56,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:57,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:57,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:09:57,008 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:09:57,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:09:57,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:09:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:57,031 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:09:57,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-10-27 06:09:57,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 60 states and 69 transitions. Complement of second has 13 states. [2018-10-27 06:09:57,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:09:57,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 26 letters. Loop has 7 letters. [2018-10-27 06:09:57,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:57,093 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:57,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:57,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:57,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:57,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:57,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:09:57,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:09:57,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:09:57,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:09:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:57,195 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:09:57,195 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-10-27 06:09:57,266 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 59 states and 68 transitions. Complement of second has 15 states. [2018-10-27 06:09:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-10-27 06:09:57,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 26 letters. Loop has 7 letters. [2018-10-27 06:09:57,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:57,267 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:57,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:57,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:57,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:57,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:57,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:09:57,339 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:09:57,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:09:57,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:09:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:57,368 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:09:57,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-10-27 06:09:57,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 74 states and 86 transitions. Complement of second has 12 states. [2018-10-27 06:09:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-10-27 06:09:57,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 26 letters. Loop has 7 letters. [2018-10-27 06:09:57,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:57,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 33 letters. Loop has 7 letters. [2018-10-27 06:09:57,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:57,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 26 letters. Loop has 14 letters. [2018-10-27 06:09:57,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:57,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 86 transitions. [2018-10-27 06:09:57,609 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:57,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2018-10-27 06:09:57,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:09:57,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:09:57,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:09:57,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:57,609 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:57,609 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:57,609 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:57,609 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:09:57,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:09:57,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:57,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:09:57,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:09:57 BoogieIcfgContainer [2018-10-27 06:09:57,616 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:09:57,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:09:57,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:09:57,618 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:09:57,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:49" (3/4) ... [2018-10-27 06:09:57,621 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:09:57,621 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:09:57,622 INFO L168 Benchmark]: Toolchain (without parser) took 9484.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:57,623 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:57,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.85 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:57,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -224.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:57,624 INFO L168 Benchmark]: Boogie Preprocessor took 27.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:57,624 INFO L168 Benchmark]: RCFGBuilder took 478.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:57,625 INFO L168 Benchmark]: BuchiAutomizer took 8481.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.9 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:57,625 INFO L168 Benchmark]: Witness Printer took 5.05 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-10-27 06:09:57,633 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.85 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -224.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 478.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8481.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.9 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.05 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * j and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + 4 * j] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.8s. Construction of modules took 0.4s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 159 SDtfs, 331 SDslu, 204 SDs, 0 SdLazy, 286 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax113 hnf98 lsp82 ukn93 mio100 lsp49 div100 bol100 ite100 ukn100 eq168 hnf88 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 3 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...