./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.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.24-2e94e6a [2019-01-01 23:07:21,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:07:21,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:07:21,998 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:07:21,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:07:22,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:07:22,002 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:07:22,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:07:22,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:07:22,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:07:22,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:07:22,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:07:22,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:07:22,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:07:22,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:07:22,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:07:22,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:07:22,023 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:07:22,025 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:07:22,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:07:22,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:07:22,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:07:22,033 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:07:22,033 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:07:22,033 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:07:22,034 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:07:22,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:07:22,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:07:22,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:07:22,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:07:22,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:07:22,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:07:22,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:07:22,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:07:22,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:07:22,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:07:22,043 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:07:22,068 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:07:22,068 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:07:22,069 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:07:22,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:07:22,070 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:07:22,070 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:07:22,070 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:07:22,071 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:07:22,071 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:07:22,071 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:07:22,071 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:07:22,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:07:22,072 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:07:22,073 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:07:22,073 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:07:22,073 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:07:22,073 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:07:22,073 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:07:22,073 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:07:22,074 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:07:22,074 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:07:22,075 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:07:22,075 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:07:22,075 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:07:22,076 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:07:22,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:07:22,076 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:07:22,076 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:07:22,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:07:22,077 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:07:22,078 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:07:22,079 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:07:22,079 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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-01-01 23:07:22,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:07:22,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:07:22,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:07:22,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:07:22,161 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:07:22,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2019-01-01 23:07:22,223 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556e92345/32737a6ba1804347b82ad327cfd25f5d/FLAG91bfb86c3 [2019-01-01 23:07:22,646 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:07:22,647 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2019-01-01 23:07:22,653 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556e92345/32737a6ba1804347b82ad327cfd25f5d/FLAG91bfb86c3 [2019-01-01 23:07:23,018 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556e92345/32737a6ba1804347b82ad327cfd25f5d [2019-01-01 23:07:23,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:07:23,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:07:23,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:07:23,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:07:23,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:07:23,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54008995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23, skipping insertion in model container [2019-01-01 23:07:23,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:07:23,067 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:07:23,328 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:07:23,336 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:07:23,376 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:07:23,401 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:07:23,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23 WrapperNode [2019-01-01 23:07:23,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:07:23,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:07:23,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:07:23,403 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:07:23,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:07:23,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:07:23,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:07:23,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:07:23,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (1/1) ... [2019-01-01 23:07:23,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:07:23,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:07:23,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:07:23,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:07:23,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (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-01-01 23:07:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:07:23,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:07:24,347 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:07:24,348 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2019-01-01 23:07:24,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:07:24 BoogieIcfgContainer [2019-01-01 23:07:24,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:07:24,349 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:07:24,349 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:07:24,353 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:07:24,354 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:07:24,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:07:23" (1/3) ... [2019-01-01 23:07:24,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b951e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:07:24, skipping insertion in model container [2019-01-01 23:07:24,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:07:24,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:23" (2/3) ... [2019-01-01 23:07:24,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b951e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:07:24, skipping insertion in model container [2019-01-01 23:07:24,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:07:24,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:07:24" (3/3) ... [2019-01-01 23:07:24,359 INFO L375 chiAutomizerObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2019-01-01 23:07:24,423 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:07:24,423 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:07:24,424 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:07:24,424 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:07:24,424 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:07:24,424 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:07:24,424 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:07:24,425 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:07:24,425 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:07:24,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-01-01 23:07:24,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-01-01 23:07:24,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:24,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:24,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:07:24,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:24,482 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:07:24,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-01-01 23:07:24,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-01-01 23:07:24,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:24,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:24,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:07:24,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:24,496 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-01-01 23:07:24,496 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-01-01 23:07:24,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:24,504 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-01-01 23:07:24,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:24,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:24,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2019-01-01 23:07:24,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:24,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:24,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:24,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:24,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:24,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:24,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:07:24,692 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:07:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 23:07:24,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 23:07:24,710 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-01-01 23:07:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:24,721 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-01-01 23:07:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:07:24,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2019-01-01 23:07:24,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-01 23:07:24,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2019-01-01 23:07:24,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-01 23:07:24,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-01 23:07:24,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-01-01 23:07:24,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:07:24,736 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-01 23:07:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-01-01 23:07:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-01 23:07:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 23:07:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-01-01 23:07:24,782 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-01 23:07:24,782 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-01 23:07:24,782 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:07:24,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-01-01 23:07:24,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-01 23:07:24,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:24,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:24,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:07:24,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:24,788 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-01-01 23:07:24,788 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-01-01 23:07:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2019-01-01 23:07:24,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:24,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:24,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:24,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2019-01-01 23:07:24,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:24,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:24,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:24,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:24,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:24,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:07:24,995 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:07:24,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:07:24,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:07:24,996 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 23:07:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:25,601 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-01-01 23:07:25,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:07:25,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2019-01-01 23:07:25,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-01-01 23:07:25,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2019-01-01 23:07:25,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-01-01 23:07:25,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-01-01 23:07:25,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2019-01-01 23:07:25,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:07:25,617 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-01-01 23:07:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2019-01-01 23:07:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2019-01-01 23:07:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 23:07:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-01-01 23:07:25,625 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-01 23:07:25,626 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-01 23:07:25,626 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:07:25,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-01-01 23:07:25,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-01-01 23:07:25,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:25,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:25,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:07:25,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:25,628 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-01-01 23:07:25,628 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-01-01 23:07:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2019-01-01 23:07:25,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:25,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2019-01-01 23:07:25,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:25,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:25,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:25,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:25,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2019-01-01 23:07:25,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:25,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:25,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:25,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-01-01 23:07:25,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:25,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:07:25,899 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-01-01 23:07:26,151 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-01-01 23:07:26,168 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:26,169 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:26,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:26,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:26,170 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:26,170 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:26,170 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:26,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:26,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-01 23:07:26,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:26,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:26,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:26,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:26,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:26,402 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 23:07:26,612 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 23:07:26,759 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:07:26,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:26,766 INFO L412 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-01-01 23:07:26,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:26,772 INFO L163 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:26,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:26,810 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:27,110 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:27,113 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:27,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:27,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:27,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:27,114 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:27,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:27,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:27,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:27,114 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-01 23:07:27,114 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:27,114 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:27,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:27,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:27,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:27,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:27,303 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:27,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:27,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:27,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:27,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:27,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:27,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:27,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:27,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:27,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:27,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:27,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:27,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:27,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:27,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:27,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:27,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:27,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:27,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:27,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:27,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:27,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:27,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:27,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:27,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:27,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:27,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:27,334 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:27,348 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:07:27,348 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:27,351 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:27,351 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:27,351 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:27,352 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-01-01 23:07:27,353 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:27,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:27,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:27,542 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-01-01 23:07:27,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 23:07:27,621 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-01-01 23:07:27,622 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-01-01 23:07:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:07:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2019-01-01 23:07:27,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2019-01-01 23:07:27,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:27,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2019-01-01 23:07:27,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:27,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2019-01-01 23:07:27,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:27,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2019-01-01 23:07:27,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-01-01 23:07:27,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2019-01-01 23:07:27,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-01-01 23:07:27,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-01-01 23:07:27,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2019-01-01 23:07:27,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:27,634 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-01-01 23:07:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2019-01-01 23:07:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-01-01 23:07:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 23:07:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-01-01 23:07:27,644 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-01-01 23:07:27,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:07:27,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:07:27,644 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2019-01-01 23:07:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:27,691 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-01-01 23:07:27,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:07:27,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2019-01-01 23:07:27,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2019-01-01 23:07:27,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2019-01-01 23:07:27,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-01-01 23:07:27,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-01-01 23:07:27,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2019-01-01 23:07:27,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:07:27,705 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-01-01 23:07:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2019-01-01 23:07:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-01-01 23:07:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 23:07:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-01-01 23:07:27,711 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-01 23:07:27,711 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-01 23:07:27,711 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:07:27,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-01-01 23:07:27,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-01-01 23:07:27,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:27,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:27,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:07:27,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:27,714 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-01-01 23:07:27,714 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-01-01 23:07:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2019-01-01 23:07:27,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:27,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:27,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2019-01-01 23:07:27,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:27,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:27,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:27,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:27,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:27,744 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2019-01-01 23:07:27,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:27,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:27,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:27,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:27,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:07:28,076 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-01-01 23:07:28,080 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:28,081 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:28,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:28,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:28,081 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:28,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:28,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:28,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:28,082 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-01 23:07:28,082 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:28,082 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:28,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:28,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:28,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:28,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:28,302 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:28,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:28,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:28,310 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:07:28,311 INFO L448 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:07:28,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:28,353 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:07:28,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:28,425 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:28,742 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:28,744 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:28,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:28,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:28,745 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:28,745 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:28,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:28,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:28,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:28,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-01 23:07:28,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:28,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:28,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:28,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:28,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:28,899 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:28,900 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:28,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:28,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:28,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:28,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:28,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:28,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:28,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:28,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:28,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:28,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:28,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:28,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:28,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:28,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:28,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:28,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:28,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:28,919 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:28,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:07:28,926 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:28,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:28,926 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:28,926 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:28,927 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-01-01 23:07:28,927 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:28,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:29,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:29,175 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-01-01 23:07:29,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-01-01 23:07:29,225 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-01-01 23:07:29,227 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-01-01 23:07:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:07:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2019-01-01 23:07:29,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2019-01-01 23:07:29,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:29,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2019-01-01 23:07:29,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:29,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2019-01-01 23:07:29,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:29,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2019-01-01 23:07:29,232 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2019-01-01 23:07:29,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2019-01-01 23:07:29,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-01-01 23:07:29,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-01-01 23:07:29,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2019-01-01 23:07:29,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:29,234 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-01-01 23:07:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2019-01-01 23:07:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2019-01-01 23:07:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 23:07:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-01-01 23:07:29,240 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-01-01 23:07:29,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:07:29,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:07:29,241 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-01-01 23:07:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:29,476 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-01-01 23:07:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:07:29,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2019-01-01 23:07:29,483 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-01-01 23:07:29,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2019-01-01 23:07:29,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-01-01 23:07:29,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-01-01 23:07:29,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2019-01-01 23:07:29,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:29,486 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-01-01 23:07:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2019-01-01 23:07:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2019-01-01 23:07:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 23:07:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-01-01 23:07:29,493 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-01 23:07:29,493 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-01 23:07:29,493 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:07:29,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-01-01 23:07:29,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-01-01 23:07:29,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:29,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:29,495 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:07:29,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:29,495 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-01-01 23:07:29,495 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-01-01 23:07:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2019-01-01 23:07:29,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:29,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:29,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:29,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2019-01-01 23:07:29,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:29,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:29,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:29,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2019-01-01 23:07:29,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:29,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:29,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:29,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:29,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:29,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:07:29,938 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-01 23:07:30,354 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-01-01 23:07:30,356 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:30,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:30,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:30,357 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:30,357 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:30,357 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:30,357 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:30,357 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:30,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-01 23:07:30,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:30,358 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:30,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:30,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:30,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:30,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:30,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:30,531 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:30,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:30,557 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:30,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:30,586 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:30,624 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:30,626 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:30,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:30,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:30,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:30,627 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:30,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:30,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:30,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:30,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-01 23:07:30,628 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:30,628 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:30,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:30,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:30,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:30,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:30,780 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:30,781 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:30,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:30,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:30,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:30,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:30,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:30,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:30,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:30,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:30,793 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:30,798 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:07:30,798 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:30,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:30,798 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:30,799 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:30,799 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-01-01 23:07:30,799 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:30,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:30,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:30,885 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-01-01 23:07:30,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 23:07:30,955 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-01-01 23:07:30,956 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-01-01 23:07:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2019-01-01 23:07:30,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2019-01-01 23:07:30,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:30,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2019-01-01 23:07:30,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:30,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2019-01-01 23:07:30,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:30,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-01-01 23:07:30,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:07:30,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2019-01-01 23:07:30,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-01-01 23:07:30,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-01-01 23:07:30,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2019-01-01 23:07:30,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:30,965 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-01-01 23:07:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2019-01-01 23:07:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-01-01 23:07:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-01 23:07:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-01-01 23:07:30,983 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-01-01 23:07:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:07:30,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:07:30,984 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 5 states. [2019-01-01 23:07:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:31,068 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-01-01 23:07:31,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:07:31,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 77 transitions. [2019-01-01 23:07:31,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-01-01 23:07:31,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 64 states and 74 transitions. [2019-01-01 23:07:31,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 23:07:31,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 23:07:31,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2019-01-01 23:07:31,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:31,071 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-01-01 23:07:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2019-01-01 23:07:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-01 23:07:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 23:07:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-01-01 23:07:31,075 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-01-01 23:07:31,075 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-01-01 23:07:31,075 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:07:31,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2019-01-01 23:07:31,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-01-01 23:07:31,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:31,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:31,077 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:07:31,077 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:31,077 INFO L794 eck$LassoCheckResult]: Stem: 1705#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; 1706#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; 1649#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1650#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1678#L24-2 [2019-01-01 23:07:31,077 INFO L796 eck$LassoCheckResult]: Loop: 1678#L24-2 assume !!(main_~j~0 <= main_~r~0); 1685#L25 assume !(main_~j~0 < main_~r~0); 1680#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; 1681#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1673#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; 1667#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1668#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1699#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; 1671#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1672#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; 1698#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1695#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1677#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1678#L24-2 [2019-01-01 23:07:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2019-01-01 23:07:31,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:31,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2019-01-01 23:07:31,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:31,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:31,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2019-01-01 23:07:31,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:31,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:31,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:31,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:31,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:07:31,339 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-01 23:07:31,631 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-01-01 23:07:31,632 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:31,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:31,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:31,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:31,632 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:31,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:31,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:31,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:31,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-01 23:07:31,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:31,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:31,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:31,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:31,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:31,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:31,858 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:31,859 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:31,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:31,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:31,869 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:07:31,869 INFO L448 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 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-01-01 23:07:31,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:31,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:31,894 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:07:31,894 INFO L448 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:31,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:31,920 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:31,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:31,949 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:32,287 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:32,289 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:32,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:32,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:32,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:32,290 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:32,290 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:32,290 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:32,290 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:32,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-01 23:07:32,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:32,290 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:32,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:32,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-01-01 23:07:32,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:32,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:32,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:32,464 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:32,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:32,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:32,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:32,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:32,467 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:07:32,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:32,468 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:07:32,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:32,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:32,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:32,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:32,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:32,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:32,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:32,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:32,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:32,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:32,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:32,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:32,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:32,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:32,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:32,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:32,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:32,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:32,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:32,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:32,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:32,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:32,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:32,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:32,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:32,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:32,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:32,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:32,484 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:32,488 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:07:32,489 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:32,489 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:32,489 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:32,489 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:32,489 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-01-01 23:07:32,490 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:32,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:32,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:32,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:32,568 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-01-01 23:07:32,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-01 23:07:32,842 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-01-01 23:07:32,844 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-01-01 23:07:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:07:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-01-01 23:07:32,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2019-01-01 23:07:32,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:32,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2019-01-01 23:07:32,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:32,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2019-01-01 23:07:32,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:32,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2019-01-01 23:07:32,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 23:07:32,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2019-01-01 23:07:32,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:07:32,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-01 23:07:32,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2019-01-01 23:07:32,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:32,858 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-01-01 23:07:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2019-01-01 23:07:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-01-01 23:07:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 23:07:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-01-01 23:07:32,869 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-01-01 23:07:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:07:32,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:07:32,869 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2019-01-01 23:07:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:33,239 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2019-01-01 23:07:33,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:07:33,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2019-01-01 23:07:33,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-01-01 23:07:33,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2019-01-01 23:07:33,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-01-01 23:07:33,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-01-01 23:07:33,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2019-01-01 23:07:33,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:33,250 INFO L705 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2019-01-01 23:07:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2019-01-01 23:07:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2019-01-01 23:07:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-01 23:07:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-01-01 23:07:33,258 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-01-01 23:07:33,258 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-01-01 23:07:33,259 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:07:33,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2019-01-01 23:07:33,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 23:07:33,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:33,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:33,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 23:07:33,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:33,264 INFO L794 eck$LassoCheckResult]: Stem: 2509#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; 2510#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; 2450#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2451#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2480#L24-2 assume !!(main_~j~0 <= main_~r~0); 2488#L25 [2019-01-01 23:07:33,264 INFO L796 eck$LassoCheckResult]: Loop: 2488#L25 assume !(main_~j~0 < main_~r~0); 2483#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; 2484#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2475#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; 2469#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2470#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; 2500#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2496#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; 2492#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2493#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; 2514#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2507#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; 2467#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2461#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2462#L24-2 assume !!(main_~j~0 <= main_~r~0); 2488#L25 [2019-01-01 23:07:33,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2019-01-01 23:07:33,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:33,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2019-01-01 23:07:33,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:33,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:33,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:33,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:07:33,493 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:07:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:07:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:07:33,494 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-01-01 23:07:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:33,675 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2019-01-01 23:07:33,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:07:33,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 238 transitions. [2019-01-01 23:07:33,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 23:07:33,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 198 states and 224 transitions. [2019-01-01 23:07:33,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 23:07:33,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-01 23:07:33,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 224 transitions. [2019-01-01 23:07:33,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:33,681 INFO L705 BuchiCegarLoop]: Abstraction has 198 states and 224 transitions. [2019-01-01 23:07:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 224 transitions. [2019-01-01 23:07:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 163. [2019-01-01 23:07:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-01 23:07:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2019-01-01 23:07:33,685 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-01-01 23:07:33,686 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-01-01 23:07:33,686 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:07:33,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2019-01-01 23:07:33,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 23:07:33,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:33,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:33,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 23:07:33,691 INFO L867 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-01-01 23:07:33,692 INFO L794 eck$LassoCheckResult]: Stem: 2862#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; 2863#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; 2800#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2801#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2830#L24-2 assume !!(main_~j~0 <= main_~r~0); 2838#L25 [2019-01-01 23:07:33,692 INFO L796 eck$LassoCheckResult]: Loop: 2838#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; 2839#L4 assume !(0 == __VERIFIER_assert_~cond); 2871#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; 2867#L4-3 assume !(0 == __VERIFIER_assert_~cond); 2857#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; 2814#L4-6 assume !(0 == __VERIFIER_assert_~cond); 2808#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; 2802#L4-9 assume !(0 == __VERIFIER_assert_~cond); 2803#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 2833#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; 2834#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2826#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; 2820#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2821#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; 2852#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2848#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; 2844#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2845#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; 2869#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2860#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; 2817#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2810#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2811#L24-2 assume !!(main_~j~0 <= main_~r~0); 2838#L25 [2019-01-01 23:07:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2019-01-01 23:07:33,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:33,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2019-01-01 23:07:33,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:33,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2019-01-01 23:07:33,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:33,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:33,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:07:33,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:07:33,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:33,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:34,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 23:07:34,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-01-01 23:07:34,769 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-01-01 23:07:34,771 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-01-01 23:07:36,058 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-01-01 23:07:36,076 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:36,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:36,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:36,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:36,076 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:36,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:36,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:36,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:36,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2019-01-01 23:07:36,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:36,077 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:36,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:36,284 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 23:07:36,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:36,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:36,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:36,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:36,494 INFO L412 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:36,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:36,499 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 23:07:36,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:36,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:36,687 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:36,689 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:36,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:36,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:36,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:36,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:36,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:36,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:36,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:36,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2019-01-01 23:07:36,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:36,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:36,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:36,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:36,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:36,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:36,811 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:36,812 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:36,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:36,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:36,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:36,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:36,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:36,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:36,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:36,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:36,826 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:36,846 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 23:07:36,846 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 23:07:36,847 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:36,847 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:36,847 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:36,847 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 5*ULTIMATE.start_main_~r~0 - 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 23:07:36,848 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:36,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:36,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:37,284 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 23:07:37,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-01 23:07:37,511 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-01 23:07:38,105 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 811 states and 884 transitions. Complement of second has 19 states. [2019-01-01 23:07:38,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:07:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2019-01-01 23:07:38,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 5 letters. Loop has 23 letters. [2019-01-01 23:07:38,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:38,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 28 letters. Loop has 23 letters. [2019-01-01 23:07:38,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:38,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 5 letters. Loop has 46 letters. [2019-01-01 23:07:38,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:38,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 811 states and 884 transitions. [2019-01-01 23:07:38,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-01-01 23:07:38,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 811 states to 644 states and 708 transitions. [2019-01-01 23:07:38,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-01-01 23:07:38,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-01-01 23:07:38,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 644 states and 708 transitions. [2019-01-01 23:07:38,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:38,127 INFO L705 BuchiCegarLoop]: Abstraction has 644 states and 708 transitions. [2019-01-01 23:07:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states and 708 transitions. [2019-01-01 23:07:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 409. [2019-01-01 23:07:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-01-01 23:07:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2019-01-01 23:07:38,137 INFO L728 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2019-01-01 23:07:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 23:07:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-01 23:07:38,138 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 12 states. [2019-01-01 23:07:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:39,720 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2019-01-01 23:07:39,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:07:39,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2019-01-01 23:07:39,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 23:07:39,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2019-01-01 23:07:39,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 23:07:39,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 23:07:39,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2019-01-01 23:07:39,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:39,731 INFO L705 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2019-01-01 23:07:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2019-01-01 23:07:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2019-01-01 23:07:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-01 23:07:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2019-01-01 23:07:39,736 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-01-01 23:07:39,736 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-01-01 23:07:39,737 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:07:39,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2019-01-01 23:07:39,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 23:07:39,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:39,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:39,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:39,739 INFO L867 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-01-01 23:07:39,739 INFO L794 eck$LassoCheckResult]: Stem: 5083#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; 5084#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; 5020#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 5021#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5050#L24-2 assume !!(main_~j~0 <= main_~r~0); 5171#L25 assume !(main_~j~0 < main_~r~0); 5055#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; 5056#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5047#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; 5042#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5043#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 5074#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; 5082#L4-30 assume !(0 == __VERIFIER_assert_~cond); 5143#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; 5140#L4-33 assume !(0 == __VERIFIER_assert_~cond); 5139#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 5103#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5032#L24-2 [2019-01-01 23:07:39,739 INFO L796 eck$LassoCheckResult]: Loop: 5032#L24-2 assume !!(main_~j~0 <= main_~r~0); 5060#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; 5061#L4 assume !(0 == __VERIFIER_assert_~cond); 5093#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; 5087#L4-3 assume !(0 == __VERIFIER_assert_~cond); 5076#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; 5035#L4-6 assume !(0 == __VERIFIER_assert_~cond); 5028#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; 5022#L4-9 assume !(0 == __VERIFIER_assert_~cond); 5023#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 5053#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; 5054#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5046#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; 5040#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5041#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; 5071#L4-18 assume !(0 == __VERIFIER_assert_~cond); 5067#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; 5063#L4-21 assume !(0 == __VERIFIER_assert_~cond); 5064#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; 5090#L4-24 assume !(0 == __VERIFIER_assert_~cond); 5079#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; 5038#L4-27 assume !(0 == __VERIFIER_assert_~cond); 5031#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5032#L24-2 [2019-01-01 23:07:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:39,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2019-01-01 23:07:39,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:39,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:39,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:39,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:39,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2019-01-01 23:07:39,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:39,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:39,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2019-01-01 23:07:39,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:39,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:39,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:39,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:39,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:40,192 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-01-01 23:07:40,194 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-01-01 23:07:40,862 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-01-01 23:07:40,865 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:40,865 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:40,865 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:40,865 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:40,866 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:40,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:40,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:40,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:40,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2019-01-01 23:07:40,866 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:40,866 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:40,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:40,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:40,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:40,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:40,964 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:40,964 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 23:07:40,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:40,970 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:40,976 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:07:40,976 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:07:40,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:40,998 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:41,002 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:07:41,002 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:07:41,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:41,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:41,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:07:41,030 INFO L448 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 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-01-01 23:07:41,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:41,053 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 23:07:41,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:41,089 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:41,195 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:41,197 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:41,197 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:41,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:41,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:41,197 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:41,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:41,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:41,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:41,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2019-01-01 23:07:41,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:41,198 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:41,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:41,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:41,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:41,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:41,540 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:41,540 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:41,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:41,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:41,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:41,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:41,545 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:07:41,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:41,546 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:07:41,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:41,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:41,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:41,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:41,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:41,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:41,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:41,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:41,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:41,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:41,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:41,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:41,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:41,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:41,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:41,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:41,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:41,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:41,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:41,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:41,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:07:41,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:41,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:41,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:41,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:41,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:41,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:41,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:41,559 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:41,564 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:07:41,564 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 23:07:41,565 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:41,565 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:41,565 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:41,565 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~r~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 23:07:41,565 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:41,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:41,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:42,642 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 23:07:42,642 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-01 23:07:42,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 408 states and 452 transitions. Complement of second has 13 states. [2019-01-01 23:07:42,940 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-01-01 23:07:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:07:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2019-01-01 23:07:42,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 17 letters. Loop has 23 letters. [2019-01-01 23:07:42,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:42,941 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:07:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:42,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:42,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:43,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 23:07:43,078 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-01 23:07:43,418 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 434 states and 478 transitions. Complement of second has 15 states. [2019-01-01 23:07:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:07:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2019-01-01 23:07:43,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 17 letters. Loop has 23 letters. [2019-01-01 23:07:43,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:43,420 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:07:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:43,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:43,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:43,548 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 5 loop predicates [2019-01-01 23:07:43,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-01 23:07:43,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 811 states and 904 transitions. Complement of second has 13 states. [2019-01-01 23:07:43,771 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-01-01 23:07:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:07:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2019-01-01 23:07:43,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 104 transitions. Stem has 17 letters. Loop has 23 letters. [2019-01-01 23:07:43,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:43,772 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:07:43,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:43,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:43,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:43,910 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 5 loop predicates [2019-01-01 23:07:43,910 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-01 23:07:44,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 699 states and 769 transitions. Complement of second has 14 states. [2019-01-01 23:07:44,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:07:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2019-01-01 23:07:44,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 23 letters. [2019-01-01 23:07:44,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:44,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 40 letters. Loop has 23 letters. [2019-01-01 23:07:44,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:44,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 46 letters. [2019-01-01 23:07:44,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:44,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 699 states and 769 transitions. [2019-01-01 23:07:44,682 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:07:44,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 699 states to 0 states and 0 transitions. [2019-01-01 23:07:44,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:07:44,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:07:44,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:07:44,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:07:44,682 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:07:44,683 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:07:44,683 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:07:44,683 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:07:44,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:07:44,683 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:07:44,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:07:44,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:07:44 BoogieIcfgContainer [2019-01-01 23:07:44,696 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:07:44,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:07:44,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:07:44,697 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:07:44,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:07:24" (3/4) ... [2019-01-01 23:07:44,706 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:07:44,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:07:44,708 INFO L168 Benchmark]: Toolchain (without parser) took 21684.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -84.7 MB). Peak memory consumption was 237.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:07:44,710 INFO L168 Benchmark]: CDTParser took 1.66 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:07:44,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:07:44,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.33 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:07:44,713 INFO L168 Benchmark]: Boogie Preprocessor took 47.88 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:07:44,714 INFO L168 Benchmark]: RCFGBuilder took 843.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:07:44,716 INFO L168 Benchmark]: BuchiAutomizer took 20347.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.8 MB). Peak memory consumption was 253.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:07:44,717 INFO L168 Benchmark]: Witness Printer took 9.07 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:07:44,724 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 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 54.33 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.88 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 843.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20347.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.8 MB). Peak memory consumption was 253.9 MB. Max. memory is 11.5 GB. * Witness Printer took 9.07 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 14 terminating modules (8 trivial, 5 deterministic, 1 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 5 * r + -8 * j and consists of 10 locations. One nondeterministic module has affine ranking function r + -1 * j and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.2s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 11.3s. Construction of modules took 4.1s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 849 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 210 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 0, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 785 SDtfs, 1359 SDslu, 1002 SDs, 0 SdLazy, 1291 SolverSat, 167 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital37 mio100 ax100 hnf97 lsp74 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp97 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 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...