./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 32bit --witnessprinter.graph.data.programhash 4fc86a08ff37d05adddb13279399a852f6ece83c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:50:18,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:50:18,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:50:18,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:50:18,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:50:18,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:50:18,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:50:18,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:50:18,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:50:18,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:50:18,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:50:18,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:50:18,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:50:18,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:50:18,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:50:18,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:50:18,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:50:18,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:50:18,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:50:18,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:50:18,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:50:18,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:50:18,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:50:18,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:50:18,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:50:18,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:50:18,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:50:18,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:50:18,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:50:18,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:50:18,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:50:18,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:50:18,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:50:18,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:50:18,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:50:18,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:50:18,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:50:18,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:50:18,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:50:18,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:50:18,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:50:18,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:50:18,509 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:50:18,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:50:18,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:50:18,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:50:18,513 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:50:18,514 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:50:18,514 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:50:18,514 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:50:18,515 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:50:18,515 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:50:18,516 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:50:18,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:50:18,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:50:18,517 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:50:18,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:50:18,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:50:18,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:50:18,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:50:18,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:50:18,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:50:18,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:50:18,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:50:18,520 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:50:18,520 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:50:18,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:50:18,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:50:18,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:50:18,522 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:50:18,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:50:18,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:50:18,522 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:50:18,524 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:50:18,525 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:50:18,526 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2019-11-28 20:50:18,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:50:18,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:50:18,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:50:18,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:50:18,924 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:50:18,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-28 20:50:18,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a573876ab/94860cd19a3b4e6cbdcac16beb105c8f/FLAG594b01f54 [2019-11-28 20:50:19,428 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:50:19,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-28 20:50:19,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a573876ab/94860cd19a3b4e6cbdcac16beb105c8f/FLAG594b01f54 [2019-11-28 20:50:19,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a573876ab/94860cd19a3b4e6cbdcac16beb105c8f [2019-11-28 20:50:19,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:50:19,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:50:19,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:50:19,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:50:19,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:50:19,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:50:19" (1/1) ... [2019-11-28 20:50:19,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318a92e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:19, skipping insertion in model container [2019-11-28 20:50:19,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:50:19" (1/1) ... [2019-11-28 20:50:19,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:50:19,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:50:20,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:50:20,022 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:50:20,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:50:20,059 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:50:20,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20 WrapperNode [2019-11-28 20:50:20,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:50:20,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:50:20,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:50:20,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:50:20,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:50:20,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:50:20,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:50:20,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:50:20,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... [2019-11-28 20:50:20,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:50:20,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:50:20,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:50:20,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:50:20,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:50:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:50:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:50:20,627 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:50:20,628 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-28 20:50:20,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:20 BoogieIcfgContainer [2019-11-28 20:50:20,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:50:20,630 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:50:20,630 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:50:20,634 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:50:20,635 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:20,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:50:19" (1/3) ... [2019-11-28 20:50:20,637 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dbe540f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:50:20, skipping insertion in model container [2019-11-28 20:50:20,637 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:20,637 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:20" (2/3) ... [2019-11-28 20:50:20,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dbe540f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:50:20, skipping insertion in model container [2019-11-28 20:50:20,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:20,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:20" (3/3) ... [2019-11-28 20:50:20,640 INFO L371 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2019-11-28 20:50:20,697 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:50:20,697 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:50:20,700 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:50:20,701 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:50:20,701 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:50:20,701 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:50:20,701 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:50:20,701 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:50:20,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-28 20:50:20,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-28 20:50:20,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:20,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:20,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:50:20,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:20,756 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:50:20,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-28 20:50:20,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-28 20:50:20,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:20,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:20,762 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:50:20,762 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:20,768 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 55#L13true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 31#L16true assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 40#L45-1true [2019-11-28 20:50:20,768 INFO L796 eck$LassoCheckResult]: Loop: 40#L45-1true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 53#L24-2true assume !true; 52#L24-3true assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 32#L4-30true assume !(0 == __VERIFIER_assert_~cond); 44#L4-32true __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 42#L4-33true assume !(0 == __VERIFIER_assert_~cond); 39#L4-35true main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 40#L45-1true [2019-11-28 20:50:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-11-28 20:50:20,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:20,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349274550] [2019-11-28 20:50:20,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:20,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:20,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:20,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2019-11-28 20:50:20,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:20,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287985907] [2019-11-28 20:50:20,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:20,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287985907] [2019-11-28 20:50:20,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:20,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:50:20,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779395675] [2019-11-28 20:50:20,940 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:50:20,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:20,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:50:20,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:50:20,955 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-11-28 20:50:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:20,964 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-11-28 20:50:20,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:50:20,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2019-11-28 20:50:20,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 20:50:20,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2019-11-28 20:50:20,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-28 20:50:20,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-28 20:50:20,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-11-28 20:50:20,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:20,978 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 20:50:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-11-28 20:50:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 20:50:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:50:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-28 20:50:21,006 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 20:50:21,006 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 20:50:21,006 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:50:21,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-28 20:50:21,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 20:50:21,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:21,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:21,009 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:50:21,009 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:21,009 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 116#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 117#L45-1 [2019-11-28 20:50:21,010 INFO L796 eck$LassoCheckResult]: Loop: 117#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 124#L24-2 assume !(main_~j~0 <= main_~r~0); 144#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 129#L4-36 assume !(0 == __VERIFIER_assert_~cond); 130#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 143#L4-39 assume !(0 == __VERIFIER_assert_~cond); 141#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 117#L45-1 [2019-11-28 20:50:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2019-11-28 20:50:21,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:21,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356322058] [2019-11-28 20:50:21,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:21,032 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:21,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:21,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2019-11-28 20:50:21,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:21,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60909233] [2019-11-28 20:50:21,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:21,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60909233] [2019-11-28 20:50:21,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:21,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:50:21,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683990025] [2019-11-28 20:50:21,099 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:50:21,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:50:21,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:50:21,102 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 20:50:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:21,267 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-11-28 20:50:21,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:50:21,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2019-11-28 20:50:21,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-28 20:50:21,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2019-11-28 20:50:21,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-28 20:50:21,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-11-28 20:50:21,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2019-11-28 20:50:21,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:21,274 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-11-28 20:50:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2019-11-28 20:50:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2019-11-28 20:50:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:50:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-28 20:50:21,280 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-28 20:50:21,280 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-28 20:50:21,280 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:50:21,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-11-28 20:50:21,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 20:50:21,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:21,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:21,282 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:50:21,282 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:21,283 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 264#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 230#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 231#L45-1 [2019-11-28 20:50:21,283 INFO L796 eck$LassoCheckResult]: Loop: 231#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 247#L24-2 assume !(main_~j~0 <= main_~r~0); 262#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 234#L4-30 assume !(0 == __VERIFIER_assert_~cond); 235#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 250#L4-33 assume !(0 == __VERIFIER_assert_~cond); 246#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 231#L45-1 [2019-11-28 20:50:21,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2019-11-28 20:50:21,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:21,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147153942] [2019-11-28 20:50:21,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:21,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2019-11-28 20:50:21,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:21,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997331484] [2019-11-28 20:50:21,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:21,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2019-11-28 20:50:21,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:21,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681857262] [2019-11-28 20:50:21,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:21,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681857262] [2019-11-28 20:50:21,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:21,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:50:21,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176332562] [2019-11-28 20:50:21,546 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:21,547 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:21,547 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:21,547 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:21,548 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:21,548 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:21,548 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:21,548 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:21,548 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-28 20:50:21,549 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:21,549 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:21,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:21,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:21,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:21,696 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:21,697 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:21,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:21,707 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:21,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:21,723 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:21,955 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:21,958 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:21,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:21,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:21,959 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:21,959 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:21,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:21,959 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:21,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:21,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-28 20:50:21,960 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:21,960 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:21,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:21,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:21,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:22,111 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:22,118 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:22,126 INFO L120 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 [2019-11-28 20:50:22,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:22,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:22,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:22,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:22,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:22,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:22,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:22,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:22,148 INFO L120 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 [2019-11-28 20:50:22,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:22,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:22,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:22,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:22,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:22,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:22,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:22,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:22,175 INFO L120 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 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:22,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:22,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:22,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:22,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:22,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:22,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:22,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:22,188 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:22,197 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:22,198 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:22,212 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:22,213 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:22,213 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:22,214 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-11-28 20:50:22,219 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:22,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:22,291 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:22,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:22,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:22,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:22,329 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 [2019-11-28 20:50:22,330 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 20:50:22,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 111 states and 132 transitions. Complement of second has 6 states. [2019-11-28 20:50:22,391 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 [2019-11-28 20:50:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:50:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2019-11-28 20:50:22,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-28 20:50:22,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:22,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-28 20:50:22,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:22,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-28 20:50:22,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:22,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2019-11-28 20:50:22,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-11-28 20:50:22,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2019-11-28 20:50:22,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-28 20:50:22,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-11-28 20:50:22,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2019-11-28 20:50:22,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:22,402 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-11-28 20:50:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2019-11-28 20:50:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-11-28 20:50:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 20:50:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-28 20:50:22,418 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-28 20:50:22,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:50:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:50:22,421 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2019-11-28 20:50:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:22,445 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-11-28 20:50:22,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:50:22,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2019-11-28 20:50:22,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2019-11-28 20:50:22,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2019-11-28 20:50:22,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-28 20:50:22,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-28 20:50:22,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2019-11-28 20:50:22,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:22,462 INFO L688 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-11-28 20:50:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2019-11-28 20:50:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-11-28 20:50:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:50:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-28 20:50:22,474 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 20:50:22,474 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 20:50:22,474 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:50:22,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-28 20:50:22,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-11-28 20:50:22,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:22,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:22,477 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:50:22,477 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:22,477 INFO L794 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 699#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 665#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 666#L45-1 [2019-11-28 20:50:22,478 INFO L796 eck$LassoCheckResult]: Loop: 666#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 705#L24-2 assume !(main_~j~0 <= main_~r~0); 703#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 670#L4-30 assume !(0 == __VERIFIER_assert_~cond); 671#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 686#L4-33 assume !(0 == __VERIFIER_assert_~cond); 682#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 666#L45-1 [2019-11-28 20:50:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2019-11-28 20:50:22,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:22,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355299549] [2019-11-28 20:50:22,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,521 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:22,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2019-11-28 20:50:22,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:22,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039659877] [2019-11-28 20:50:22,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2019-11-28 20:50:22,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:22,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798546696] [2019-11-28 20:50:22,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:22,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798546696] [2019-11-28 20:50:22,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:22,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:50:22,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011887716] [2019-11-28 20:50:22,781 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:22,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:22,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:22,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:22,781 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:22,782 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:22,782 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:22,782 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:22,782 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-28 20:50:22,782 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:22,782 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:22,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:22,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:22,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:22,890 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:22,890 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:22,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:22,897 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:22,902 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:50:22,902 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:22,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:22,921 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:22,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:22,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:23,386 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:23,396 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:23,396 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:23,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:23,396 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:23,396 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:23,397 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,397 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:23,397 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:23,397 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-28 20:50:23,397 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:23,398 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:23,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:23,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:23,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:23,539 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:23,540 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:23,548 INFO L120 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 [2019-11-28 20:50:23,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:23,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:23,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:23,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:23,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:23,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:23,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:23,570 INFO L120 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 [2019-11-28 20:50:23,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:23,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:23,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:23,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:23,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:23,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:23,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:23,588 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:23,588 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,601 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:23,601 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:23,601 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:23,601 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-11-28 20:50:23,605 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:23,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:23,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:23,666 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:23,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:23,679 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 [2019-11-28 20:50:23,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-11-28 20:50:23,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 155 states and 181 transitions. Complement of second has 6 states. [2019-11-28 20:50:23,712 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 [2019-11-28 20:50:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:50:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2019-11-28 20:50:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-28 20:50:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-28 20:50:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-28 20:50:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:23,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2019-11-28 20:50:23,716 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2019-11-28 20:50:23,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2019-11-28 20:50:23,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-28 20:50:23,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-11-28 20:50:23,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2019-11-28 20:50:23,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:23,719 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-28 20:50:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2019-11-28 20:50:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2019-11-28 20:50:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 20:50:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-11-28 20:50:23,724 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-11-28 20:50:23,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:23,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:50:23,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:50:23,725 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-11-28 20:50:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:23,901 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-11-28 20:50:23,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:50:23,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2019-11-28 20:50:23,907 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-11-28 20:50:23,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2019-11-28 20:50:23,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-11-28 20:50:23,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-11-28 20:50:23,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2019-11-28 20:50:23,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:23,910 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-11-28 20:50:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2019-11-28 20:50:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2019-11-28 20:50:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:50:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-28 20:50:23,924 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 20:50:23,924 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 20:50:23,924 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:50:23,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-28 20:50:23,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-28 20:50:23,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:23,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:23,929 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:50:23,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:23,930 INFO L794 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1260#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1203#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1205#L45-1 [2019-11-28 20:50:23,930 INFO L796 eck$LassoCheckResult]: Loop: 1205#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1232#L24-2 assume !!(main_~j~0 <= main_~r~0); 1239#L25 assume !(main_~j~0 < main_~r~0); 1236#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1234#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1228#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1222#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1223#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1253#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1226#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1227#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1252#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1249#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1205#L45-1 [2019-11-28 20:50:23,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2019-11-28 20:50:23,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:23,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250516324] [2019-11-28 20:50:23,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2019-11-28 20:50:23,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:23,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395164558] [2019-11-28 20:50:23,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,025 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2019-11-28 20:50:24,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368222630] [2019-11-28 20:50:24,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:24,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368222630] [2019-11-28 20:50:24,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:24,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:50:24,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786306061] [2019-11-28 20:50:24,215 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-28 20:50:24,347 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-11-28 20:50:24,349 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:24,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:24,349 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:24,349 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:24,349 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:24,349 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:24,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:24,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-28 20:50:24,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:24,350 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:24,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:24,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:24,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:24,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:24,464 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:24,464 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:24,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:24,478 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:24,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:24,521 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:24,524 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:24,525 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:24,525 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:24,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:24,525 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:24,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:24,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:24,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-28 20:50:24,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:24,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:24,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:24,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:24,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:24,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:24,648 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:24,648 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,656 INFO L120 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 [2019-11-28 20:50:24,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:24,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:24,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:24,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:24,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:24,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:24,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:24,669 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:24,675 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 20:50:24,675 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,679 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:24,679 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:24,680 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:24,680 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-28 20:50:24,683 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:24,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:24,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:24,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:24,726 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 [2019-11-28 20:50:24,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 20:50:24,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 124 states and 144 transitions. Complement of second has 4 states. [2019-11-28 20:50:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:50:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2019-11-28 20:50:24,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2019-11-28 20:50:24,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2019-11-28 20:50:24,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2019-11-28 20:50:24,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-11-28 20:50:24,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-11-28 20:50:24,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2019-11-28 20:50:24,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-28 20:50:24,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-28 20:50:24,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2019-11-28 20:50:24,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:24,763 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-11-28 20:50:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2019-11-28 20:50:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-11-28 20:50:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 20:50:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-11-28 20:50:24,768 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-11-28 20:50:24,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:50:24,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:50:24,769 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 4 states. [2019-11-28 20:50:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:24,812 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-28 20:50:24,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:50:24,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 75 transitions. [2019-11-28 20:50:24,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-28 20:50:24,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 74 transitions. [2019-11-28 20:50:24,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 20:50:24,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 20:50:24,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2019-11-28 20:50:24,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:24,814 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 20:50:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2019-11-28 20:50:24,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 20:50:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:50:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-28 20:50:24,817 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 20:50:24,817 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 20:50:24,818 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:50:24,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2019-11-28 20:50:24,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-28 20:50:24,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:24,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:24,819 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:50:24,819 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:24,820 INFO L794 eck$LassoCheckResult]: Stem: 1702#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1703#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1646#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1647#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1675#L24-2 [2019-11-28 20:50:24,820 INFO L796 eck$LassoCheckResult]: Loop: 1675#L24-2 assume !!(main_~j~0 <= main_~r~0); 1682#L25 assume !(main_~j~0 < main_~r~0); 1677#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1678#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1670#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1664#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1665#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1696#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1668#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1669#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1695#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1692#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1674#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1675#L24-2 [2019-11-28 20:50:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2019-11-28 20:50:24,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058270729] [2019-11-28 20:50:24,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2019-11-28 20:50:24,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833062826] [2019-11-28 20:50:24,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2019-11-28 20:50:24,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473568180] [2019-11-28 20:50:24,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:24,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473568180] [2019-11-28 20:50:24,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:24,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:50:24,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337302007] [2019-11-28 20:50:25,204 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-11-28 20:50:25,206 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:25,207 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:25,207 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:25,207 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:25,207 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:25,207 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,207 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:25,208 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:25,208 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-28 20:50:25,208 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:25,208 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:25,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:25,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:25,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:25,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:25,308 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:25,308 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:25,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:25,316 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:50:25,317 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=7} Honda state: {ULTIMATE.start_main_#t~nondet5=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:25,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:25,326 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:50:25,326 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:25,333 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:25,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:25,686 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:25,689 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:25,689 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:25,689 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:25,689 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:25,689 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:25,689 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,689 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:25,689 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:25,690 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-28 20:50:25,690 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:25,690 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:25,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:25,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:25,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:25,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:25,788 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:25,788 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:25,807 INFO L120 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 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:25,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:25,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:25,810 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:50:25,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:25,811 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:50:25,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:25,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,831 INFO L120 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 [2019-11-28 20:50:25,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:25,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:25,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:25,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:25,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:25,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:25,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:25,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,844 INFO L120 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 [2019-11-28 20:50:25,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:25,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:25,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:25,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:25,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:25,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:25,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:25,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:25,861 INFO L120 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 [2019-11-28 20:50:25,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:25,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:25,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:25,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:25,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:25,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:25,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:25,876 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:25,876 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:25,881 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:25,882 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:25,882 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:25,882 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-28 20:50:25,893 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,918 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:25,949 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 [2019-11-28 20:50:25,949 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 20:50:25,998 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 128 states and 150 transitions. Complement of second has 6 states. [2019-11-28 20:50:25,999 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 [2019-11-28 20:50:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:50:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-11-28 20:50:25,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2019-11-28 20:50:26,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2019-11-28 20:50:26,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2019-11-28 20:50:26,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2019-11-28 20:50:26,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:50:26,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2019-11-28 20:50:26,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 20:50:26,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 20:50:26,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2019-11-28 20:50:26,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:26,005 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-11-28 20:50:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2019-11-28 20:50:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-28 20:50:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 20:50:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-11-28 20:50:26,010 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-28 20:50:26,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:50:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:50:26,011 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2019-11-28 20:50:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:26,211 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2019-11-28 20:50:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:50:26,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2019-11-28 20:50:26,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-28 20:50:26,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2019-11-28 20:50:26,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-28 20:50:26,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-11-28 20:50:26,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2019-11-28 20:50:26,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:26,223 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2019-11-28 20:50:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2019-11-28 20:50:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2019-11-28 20:50:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 20:50:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-11-28 20:50:26,229 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-28 20:50:26,229 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-28 20:50:26,229 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:50:26,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2019-11-28 20:50:26,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:50:26,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:26,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:26,232 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:50:26,232 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:26,232 INFO L794 eck$LassoCheckResult]: Stem: 2504#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2505#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2447#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2448#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2475#L24-2 assume !!(main_~j~0 <= main_~r~0); 2483#L25 [2019-11-28 20:50:26,232 INFO L796 eck$LassoCheckResult]: Loop: 2483#L25 assume !(main_~j~0 < main_~r~0); 2478#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2479#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2471#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2465#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2466#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2495#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2491#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2487#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2488#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2508#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2502#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2463#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2457#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2458#L24-2 assume !!(main_~j~0 <= main_~r~0); 2483#L25 [2019-11-28 20:50:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,233 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2019-11-28 20:50:26,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880954159] [2019-11-28 20:50:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,262 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2019-11-28 20:50:26,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638954562] [2019-11-28 20:50:26,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:26,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638954562] [2019-11-28 20:50:26,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:26,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:50:26,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013668496] [2019-11-28 20:50:26,376 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:50:26,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:50:26,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:50:26,378 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-11-28 20:50:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:26,567 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2019-11-28 20:50:26,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:50:26,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 254 transitions. [2019-11-28 20:50:26,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:50:26,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 240 transitions. [2019-11-28 20:50:26,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 20:50:26,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 20:50:26,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 240 transitions. [2019-11-28 20:50:26,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:26,574 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 240 transitions. [2019-11-28 20:50:26,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 240 transitions. [2019-11-28 20:50:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 163. [2019-11-28 20:50:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-28 20:50:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2019-11-28 20:50:26,581 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-28 20:50:26,582 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-28 20:50:26,582 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:50:26,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2019-11-28 20:50:26,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:50:26,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:26,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:26,585 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:50:26,585 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:26,586 INFO L794 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2871#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2811#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2812#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2839#L24-2 assume !!(main_~j~0 <= main_~r~0); 2848#L25 [2019-11-28 20:50:26,588 INFO L796 eck$LassoCheckResult]: Loop: 2848#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2849#L4 assume !(0 == __VERIFIER_assert_~cond); 2879#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2875#L4-3 assume !(0 == __VERIFIER_assert_~cond); 2866#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2825#L4-6 assume !(0 == __VERIFIER_assert_~cond); 2819#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2813#L4-9 assume !(0 == __VERIFIER_assert_~cond); 2814#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 2842#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2843#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2835#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2829#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2830#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2861#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2857#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2853#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2854#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2877#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2868#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2827#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2821#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2822#L24-2 assume !!(main_~j~0 <= main_~r~0); 2848#L25 [2019-11-28 20:50:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2019-11-28 20:50:26,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848973587] [2019-11-28 20:50:26,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2019-11-28 20:50:26,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074790307] [2019-11-28 20:50:26,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,624 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2019-11-28 20:50:26,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949813395] [2019-11-28 20:50:26,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:26,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949813395] [2019-11-28 20:50:26,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978026926] [2019-11-28 20:50:26,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:50:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:26,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:50:26,721 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:26,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:26,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:26,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:50:26,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-28 20:50:26,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129505324] [2019-11-28 20:50:27,199 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-28 20:50:27,201 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-28 20:50:27,986 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-11-28 20:50:28,006 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:28,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:28,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:28,007 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:28,007 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:28,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,007 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:28,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:28,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-28 20:50:28,008 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:28,008 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:28,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:28,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:28,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:28,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:28,112 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:28,112 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:28,119 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:28,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:28,233 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:28,235 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:28,235 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:28,235 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:28,235 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:28,235 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:28,236 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,236 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:28,236 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:28,236 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-28 20:50:28,236 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:28,236 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:28,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:28,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:28,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:28,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:28,344 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:28,344 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,349 INFO L120 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 [2019-11-28 20:50:28,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:28,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:28,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:28,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:28,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:28,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:28,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:28,355 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:28,360 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:50:28,360 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,364 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:28,364 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:28,365 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:28,365 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 20:50:28,367 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,389 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:28,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:28,573 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 20:50:28,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-28 20:50:28,861 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 638 states and 696 transitions. Complement of second has 17 states. [2019-11-28 20:50:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 20:50:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:50:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2019-11-28 20:50:28,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 78 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-28 20:50:28,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:28,863 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,890 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:28,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:29,035 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 20:50:29,035 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-28 20:50:29,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 724 states and 790 transitions. Complement of second has 27 states. [2019-11-28 20:50:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-28 20:50:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:50:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2019-11-28 20:50:29,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-28 20:50:29,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:29,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 28 letters. Loop has 23 letters. [2019-11-28 20:50:29,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:29,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 46 letters. [2019-11-28 20:50:29,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:29,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 790 transitions. [2019-11-28 20:50:29,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-28 20:50:29,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 581 states and 644 transitions. [2019-11-28 20:50:29,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-28 20:50:29,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 20:50:29,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 644 transitions. [2019-11-28 20:50:29,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:29,607 INFO L688 BuchiCegarLoop]: Abstraction has 581 states and 644 transitions. [2019-11-28 20:50:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 644 transitions. [2019-11-28 20:50:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 409. [2019-11-28 20:50:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-28 20:50:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2019-11-28 20:50:29,615 INFO L711 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2019-11-28 20:50:29,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:50:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:50:29,615 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 7 states. [2019-11-28 20:50:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:30,048 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2019-11-28 20:50:30,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:50:30,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2019-11-28 20:50:30,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:50:30,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2019-11-28 20:50:30,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 20:50:30,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 20:50:30,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2019-11-28 20:50:30,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:30,057 INFO L688 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2019-11-28 20:50:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2019-11-28 20:50:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2019-11-28 20:50:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-28 20:50:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2019-11-28 20:50:30,062 INFO L711 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-28 20:50:30,062 INFO L591 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-28 20:50:30,062 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:50:30,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2019-11-28 20:50:30,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:50:30,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:30,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:30,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:30,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:30,066 INFO L794 eck$LassoCheckResult]: Stem: 5774#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 5775#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 5713#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 5714#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5743#L24-2 assume !!(main_~j~0 <= main_~r~0); 5859#L25 assume !(main_~j~0 < main_~r~0); 5858#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5917#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5916#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5734#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5735#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 5768#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5719#L4-30 assume !(0 == __VERIFIER_assert_~cond); 5720#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5750#L4-33 assume !(0 == __VERIFIER_assert_~cond); 5751#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 5790#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5724#L24-2 [2019-11-28 20:50:30,066 INFO L796 eck$LassoCheckResult]: Loop: 5724#L24-2 assume !!(main_~j~0 <= main_~r~0); 5752#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5753#L4 assume !(0 == __VERIFIER_assert_~cond); 5784#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5778#L4-3 assume !(0 == __VERIFIER_assert_~cond); 5769#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5727#L4-6 assume !(0 == __VERIFIER_assert_~cond); 5721#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5715#L4-9 assume !(0 == __VERIFIER_assert_~cond); 5716#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 5746#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5747#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5738#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5732#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5733#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5765#L4-18 assume !(0 == __VERIFIER_assert_~cond); 5761#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5757#L4-21 assume !(0 == __VERIFIER_assert_~cond); 5758#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5781#L4-24 assume !(0 == __VERIFIER_assert_~cond); 5772#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5730#L4-27 assume !(0 == __VERIFIER_assert_~cond); 5723#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5724#L24-2 [2019-11-28 20:50:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2019-11-28 20:50:30,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:30,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927287002] [2019-11-28 20:50:30,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:30,085 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2019-11-28 20:50:30,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:30,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11214966] [2019-11-28 20:50:30,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:30,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:30,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:30,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2019-11-28 20:50:30,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:30,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979126] [2019-11-28 20:50:30,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:30,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:30,318 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-28 20:50:30,320 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-28 20:50:30,919 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-11-28 20:50:30,921 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:30,921 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:30,921 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:30,921 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:30,922 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:30,922 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:30,922 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:30,922 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:30,922 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-28 20:50:30,922 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:30,922 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:30,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:30,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:30,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:30,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:31,027 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:31,028 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:31,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:31,036 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:31,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:31,055 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:31,154 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:31,156 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:31,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:31,156 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:31,156 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:31,156 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:31,156 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:31,156 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:31,156 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:31,156 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-28 20:50:31,156 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:31,157 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:31,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:31,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:31,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:31,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:31,264 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:31,264 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:31,270 INFO L120 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 [2019-11-28 20:50:31,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:31,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:31,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:31,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:31,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:31,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:31,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:31,276 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:31,280 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:50:31,280 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:31,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:31,284 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:31,284 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:31,284 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-28 20:50:31,286 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:31,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:31,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:31,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:50:31,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:31,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:31,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:31,427 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 [2019-11-28 20:50:31,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-28 20:50:31,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 384 states and 424 transitions. Complement of second has 17 states. [2019-11-28 20:50:31,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 20:50:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:50:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2019-11-28 20:50:31,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 61 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-28 20:50:31,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:31,713 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:31,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:31,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:31,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:50:31,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:31,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:31,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:31,862 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 [2019-11-28 20:50:31,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-28 20:50:32,351 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 460 states and 504 transitions. Complement of second has 25 states. [2019-11-28 20:50:32,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-28 20:50:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:50:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2019-11-28 20:50:32,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 80 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-28 20:50:32,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:32,358 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:32,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:32,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:32,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:50:32,411 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:32,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:32,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:32,520 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 [2019-11-28 20:50:32,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-28 20:50:32,804 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 804 states and 878 transitions. Complement of second has 16 states. [2019-11-28 20:50:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 20:50:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:50:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2019-11-28 20:50:32,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 114 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-28 20:50:32,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:32,806 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:32,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:32,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:32,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:50:32,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:32,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:32,955 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 20:50:32,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-28 20:50:33,422 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 777 states and 851 transitions. Complement of second has 24 states. [2019-11-28 20:50:33,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-28 20:50:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:50:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2019-11-28 20:50:33,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-28 20:50:33,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:33,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 40 letters. Loop has 23 letters. [2019-11-28 20:50:33,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:33,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 17 letters. Loop has 46 letters. [2019-11-28 20:50:33,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:33,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 851 transitions. [2019-11-28 20:50:33,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:50:33,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 546 states and 604 transitions. [2019-11-28 20:50:33,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 20:50:33,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 20:50:33,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 604 transitions. [2019-11-28 20:50:33,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:33,432 INFO L688 BuchiCegarLoop]: Abstraction has 546 states and 604 transitions. [2019-11-28 20:50:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 604 transitions. [2019-11-28 20:50:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 403. [2019-11-28 20:50:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-28 20:50:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 449 transitions. [2019-11-28 20:50:33,438 INFO L711 BuchiCegarLoop]: Abstraction has 403 states and 449 transitions. [2019-11-28 20:50:33,438 INFO L591 BuchiCegarLoop]: Abstraction has 403 states and 449 transitions. [2019-11-28 20:50:33,438 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:50:33,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 449 transitions. [2019-11-28 20:50:33,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:50:33,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:33,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:33,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:33,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:33,442 INFO L794 eck$LassoCheckResult]: Stem: 9056#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 9057#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 8991#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 8992#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 9021#L24-2 assume !!(main_~j~0 <= main_~r~0); 9253#L25 assume !(main_~j~0 < main_~r~0); 9035#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9393#L4-12 assume !(0 == __VERIFIER_assert_~cond); 9392#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9391#L4-15 assume !(0 == __VERIFIER_assert_~cond); 9390#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 9054#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9055#L4-30 assume !(0 == __VERIFIER_assert_~cond); 9036#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9029#L4-33 assume !(0 == __VERIFIER_assert_~cond); 9019#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 9020#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 9022#L24-2 assume !!(main_~j~0 <= main_~r~0); 9073#L25 [2019-11-28 20:50:33,443 INFO L796 eck$LassoCheckResult]: Loop: 9073#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9070#L4 assume !(0 == __VERIFIER_assert_~cond); 9068#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9062#L4-3 assume !(0 == __VERIFIER_assert_~cond); 9048#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9005#L4-6 assume !(0 == __VERIFIER_assert_~cond); 8999#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8993#L4-9 assume !(0 == __VERIFIER_assert_~cond); 8994#L4-11 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; 9024#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9025#L4-12 assume !(0 == __VERIFIER_assert_~cond); 9017#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9011#L4-15 assume !(0 == __VERIFIER_assert_~cond); 9012#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9045#L4-18 assume !(0 == __VERIFIER_assert_~cond); 9041#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9037#L4-21 assume !(0 == __VERIFIER_assert_~cond); 9038#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9065#L4-24 assume !(0 == __VERIFIER_assert_~cond); 9051#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9008#L4-27 assume !(0 == __VERIFIER_assert_~cond); 9001#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 9002#L24-2 assume !!(main_~j~0 <= main_~r~0); 9073#L25 [2019-11-28 20:50:33,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:33,443 INFO L82 PathProgramCache]: Analyzing trace with hash -430226800, now seen corresponding path program 2 times [2019-11-28 20:50:33,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:33,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698804468] [2019-11-28 20:50:33,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:33,458 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 992185381, now seen corresponding path program 1 times [2019-11-28 20:50:33,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:33,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645376609] [2019-11-28 20:50:33,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:33,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1977821002, now seen corresponding path program 1 times [2019-11-28 20:50:33,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:33,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988455824] [2019-11-28 20:50:33,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:33,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:33,691 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-11-28 20:50:33,692 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-28 20:50:34,019 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:34,019 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:34,019 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:34,019 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:34,019 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:34,019 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:34,019 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:34,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:34,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2019-11-28 20:50:34,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:34,020 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:34,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:34,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:34,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:34,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:34,134 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:34,135 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:34,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:34,143 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:34,149 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:50:34,150 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:34,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:34,163 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:34,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:50:34,169 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:34,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:34,180 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:34,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:34,198 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:34,299 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:34,301 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:34,301 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:34,301 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:34,301 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:34,302 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:34,302 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:34,302 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:34,302 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:34,302 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2019-11-28 20:50:34,302 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:34,302 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:34,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:34,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:34,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:34,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:50:34,401 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:34,402 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:34,407 INFO L120 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 [2019-11-28 20:50:34,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:34,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:34,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:34,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:34,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:34,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:34,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:34,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:34,421 INFO L120 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 [2019-11-28 20:50:34,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:34,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:34,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:34,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:34,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:34,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:34,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:34,429 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:34,434 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:34,434 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:34,438 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:34,439 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:34,439 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:34,439 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~r~0) = -4*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-28 20:50:34,442 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:34,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:34,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:34,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:50:34,487 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:34,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:34,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 20:50:34,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-28 20:50:34,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 617 states and 677 transitions. Complement of second has 13 states. [2019-11-28 20:50:34,786 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 [2019-11-28 20:50:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:50:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2019-11-28 20:50:34,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-28 20:50:34,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:34,788 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:34,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:34,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:34,851 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:50:34,852 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:34,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:34,928 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 20:50:34,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-28 20:50:35,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 617 states and 677 transitions. Complement of second has 13 states. [2019-11-28 20:50:35,135 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 [2019-11-28 20:50:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:50:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2019-11-28 20:50:35,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-28 20:50:35,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:35,136 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:35,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:35,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:35,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:35,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:50:35,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:35,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:50:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:35,246 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 4 loop predicates [2019-11-28 20:50:35,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-28 20:50:35,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 897 states and 970 transitions. Complement of second has 12 states. [2019-11-28 20:50:35,534 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 [2019-11-28 20:50:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:50:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2019-11-28 20:50:35,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-28 20:50:35,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:35,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 41 letters. Loop has 23 letters. [2019-11-28 20:50:35,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:35,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 18 letters. Loop has 46 letters. [2019-11-28 20:50:35,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:35,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 897 states and 970 transitions. [2019-11-28 20:50:35,548 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:35,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 897 states to 0 states and 0 transitions. [2019-11-28 20:50:35,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:50:35,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:50:35,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:50:35,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:35,549 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:35,549 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:35,549 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:35,550 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:50:35,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:50:35,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:35,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:50:35,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:50:35 BoogieIcfgContainer [2019-11-28 20:50:35,558 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:50:35,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:50:35,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:50:35,560 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:50:35,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:20" (3/4) ... [2019-11-28 20:50:35,565 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:50:35,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:50:35,568 INFO L168 Benchmark]: Toolchain (without parser) took 15750.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 959.0 MB in the beginning and 1.3 GB in the end (delta: -315.8 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:35,569 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:35,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.20 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:35,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:35,572 INFO L168 Benchmark]: Boogie Preprocessor took 26.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:35,575 INFO L168 Benchmark]: RCFGBuilder took 446.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:35,578 INFO L168 Benchmark]: BuchiAutomizer took 14928.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -166.0 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:35,579 INFO L168 Benchmark]: Witness Printer took 5.73 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:35,582 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.20 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 446.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14928.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -166.0 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.73 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (8 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 3 * n and consists of 14 locations. One nondeterministic module has affine ranking function 3 * n + -2 * j and consists of 13 locations. One nondeterministic module has affine ranking function -4 * j + 3 * r and consists of 7 locations. 8 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.8s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 8.3s. Construction of modules took 2.3s. Büchi inclusion checks took 3.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 943 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 403 states and ocurred in iteration 9. Nontrivial modules had stage [4, 1, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 988 SDtfs, 1744 SDslu, 1216 SDs, 0 SdLazy, 2038 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT2 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital37 mio100 ax100 hnf97 lsp73 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp98 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...