./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 0ed9222f 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-0ed9222-m [2019-01-14 03:48:47,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:48:47,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:48:47,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:48:47,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:48:47,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:48:47,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:48:47,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:48:47,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:48:47,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:48:47,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:48:47,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:48:47,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:48:47,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:48:47,169 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:48:47,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:48:47,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:48:47,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:48:47,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:48:47,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:48:47,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:48:47,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:48:47,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:48:47,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:48:47,182 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:48:47,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:48:47,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:48:47,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:48:47,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:48:47,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:48:47,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:48:47,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:48:47,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:48:47,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:48:47,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:48:47,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:48:47,190 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:48:47,207 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:48:47,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:48:47,209 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:48:47,209 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:48:47,209 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:48:47,209 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:48:47,209 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:48:47,210 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:48:47,210 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:48:47,210 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:48:47,210 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:48:47,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:48:47,210 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:48:47,211 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:48:47,211 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:48:47,211 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:48:47,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:48:47,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:48:47,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:48:47,212 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:48:47,212 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:48:47,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:48:47,212 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:48:47,212 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:48:47,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:48:47,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:48:47,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:48:47,213 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:48:47,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:48:47,213 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:48:47,214 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:48:47,214 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:48:47,215 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-14 03:48:47,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:48:47,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:48:47,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:48:47,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:48:47,299 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:48:47,300 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2019-01-14 03:48:47,359 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ced453d/9f035bc344ab462e8b41c98f7bf11695/FLAG2a621e64f [2019-01-14 03:48:47,824 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:48:47,825 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2019-01-14 03:48:47,833 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ced453d/9f035bc344ab462e8b41c98f7bf11695/FLAG2a621e64f [2019-01-14 03:48:48,142 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ced453d/9f035bc344ab462e8b41c98f7bf11695 [2019-01-14 03:48:48,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:48:48,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:48:48,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:48:48,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:48:48,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:48:48,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48, skipping insertion in model container [2019-01-14 03:48:48,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:48:48,184 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:48:48,412 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:48:48,418 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:48:48,441 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:48:48,456 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:48:48,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48 WrapperNode [2019-01-14 03:48:48,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:48:48,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:48:48,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:48:48,459 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:48:48,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:48:48,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:48:48,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:48:48,523 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:48:48,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (1/1) ... [2019-01-14 03:48:48,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:48:48,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:48:48,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:48:48,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:48:48,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (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-14 03:48:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:48:48,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:48:49,228 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:48:49,228 INFO L286 CfgBuilder]: Removed 34 assue(true) statements. [2019-01-14 03:48:49,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:48:49 BoogieIcfgContainer [2019-01-14 03:48:49,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:48:49,230 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:48:49,230 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:48:49,234 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:48:49,235 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:48:49,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:48:48" (1/3) ... [2019-01-14 03:48:49,236 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@120fd2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:48:49, skipping insertion in model container [2019-01-14 03:48:49,236 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:48:49,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:48:48" (2/3) ... [2019-01-14 03:48:49,237 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@120fd2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:48:49, skipping insertion in model container [2019-01-14 03:48:49,237 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:48:49,237 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:48:49" (3/3) ... [2019-01-14 03:48:49,240 INFO L375 chiAutomizerObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2019-01-14 03:48:49,310 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:48:49,311 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:48:49,311 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:48:49,311 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:48:49,311 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:48:49,311 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:48:49,312 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:48:49,313 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:48:49,313 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:48:49,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-01-14 03:48:49,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-01-14 03:48:49,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:49,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:49,366 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:48:49,367 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:48:49,367 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:48:49,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-01-14 03:48:49,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-01-14 03:48:49,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:49,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:49,373 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:48:49,373 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:48:49,379 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-14 03:48:49,380 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-14 03:48:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-01-14 03:48:49,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:49,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:49,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2019-01-14 03:48:49,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:49,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:49,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:49,538 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-14 03:48:49,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:48:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:48:49,546 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:48:49,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 03:48:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 03:48:49,562 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-01-14 03:48:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:48:49,572 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-01-14 03:48:49,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:48:49,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2019-01-14 03:48:49,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-14 03:48:49,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2019-01-14 03:48:49,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-14 03:48:49,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 03:48:49,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-01-14 03:48:49,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:48:49,590 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-14 03:48:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-01-14 03:48:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-14 03:48:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 03:48:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-01-14 03:48:49,632 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-14 03:48:49,632 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-14 03:48:49,633 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:48:49,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-01-14 03:48:49,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-14 03:48:49,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:49,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:49,638 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:48:49,638 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:48:49,638 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-14 03:48:49,638 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-14 03:48:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:49,640 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2019-01-14 03:48:49,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:49,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:49,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:49,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:49,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2019-01-14 03:48:49,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:49,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:49,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:49,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:48:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:49,759 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-14 03:48:49,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:48:49,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:48:49,760 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:48:49,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:48:49,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:48:49,761 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-14 03:48:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:48:50,228 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-01-14 03:48:50,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:48:50,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2019-01-14 03:48:50,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-01-14 03:48:50,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2019-01-14 03:48:50,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-01-14 03:48:50,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-01-14 03:48:50,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2019-01-14 03:48:50,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:48:50,237 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-01-14 03:48:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2019-01-14 03:48:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2019-01-14 03:48:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 03:48:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-01-14 03:48:50,243 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-14 03:48:50,243 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-14 03:48:50,243 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:48:50,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-01-14 03:48:50,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-01-14 03:48:50,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:50,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:50,246 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:48:50,246 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:48:50,247 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-14 03:48:50,247 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-14 03:48:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:50,248 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2019-01-14 03:48:50,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:50,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:50,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2019-01-14 03:48:50,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:50,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:50,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:50,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:48:50,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:50,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2019-01-14 03:48:50,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:50,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:50,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:50,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:50,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:50,336 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-14 03:48:50,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:48:50,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:48:50,451 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-01-14 03:48:50,686 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-01-14 03:48:50,701 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:48:50,702 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:48:50,702 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:48:50,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:48:50,703 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:48:50,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:50,703 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:48:50,703 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:48:50,703 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 03:48:50,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:48:50,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:48:50,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-14 03:48:50,751 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-14 03:48:50,757 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-14 03:48:51,056 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 03:48:51,186 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:48:51,187 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-14 03:48:51,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:48:51,195 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-14 03:48:51,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:48:51,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:48:51,506 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:48:51,508 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:48:51,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:48:51,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:48:51,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:48:51,509 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:48:51,509 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:51,509 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:48:51,509 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:48:51,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 03:48:51,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:48:51,510 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:48:51,512 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-14 03:48:51,517 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-14 03:48:51,527 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-14 03:48:51,703 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:48:51,708 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:48:51,709 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-14 03:48:51,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:51,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:51,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:51,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:51,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:51,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:51,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:51,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:48:51,717 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-14 03:48:51,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:51,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:51,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:51,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:51,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:51,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:51,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:51,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:48:51,724 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-14 03:48:51,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:51,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:51,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:51,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:51,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:51,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:51,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:51,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:48:51,757 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:48:51,758 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:48:51,762 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:48:51,762 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:48:51,762 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:48:51,763 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-14 03:48:51,764 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:48:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:51,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:51,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:51,928 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-14 03:48:51,932 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-14 03:48:51,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 03:48:52,004 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-14 03:48:52,005 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-14 03:48:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:48:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2019-01-14 03:48:52,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2019-01-14 03:48:52,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:52,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2019-01-14 03:48:52,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:52,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2019-01-14 03:48:52,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:52,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2019-01-14 03:48:52,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-01-14 03:48:52,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2019-01-14 03:48:52,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-01-14 03:48:52,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-01-14 03:48:52,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2019-01-14 03:48:52,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:48:52,025 INFO L706 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-01-14 03:48:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2019-01-14 03:48:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-01-14 03:48:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 03:48:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-01-14 03:48:52,033 INFO L729 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-01-14 03:48:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:48:52,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:48:52,034 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2019-01-14 03:48:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:48:52,073 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-01-14 03:48:52,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:48:52,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2019-01-14 03:48:52,078 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2019-01-14 03:48:52,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2019-01-14 03:48:52,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-01-14 03:48:52,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-01-14 03:48:52,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2019-01-14 03:48:52,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:48:52,082 INFO L706 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-01-14 03:48:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2019-01-14 03:48:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-01-14 03:48:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 03:48:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-01-14 03:48:52,089 INFO L729 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-14 03:48:52,089 INFO L609 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-14 03:48:52,089 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:48:52,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-01-14 03:48:52,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-01-14 03:48:52,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:52,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:52,091 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:48:52,091 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:48:52,093 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-14 03:48:52,093 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-14 03:48:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2019-01-14 03:48:52,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:52,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:52,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2019-01-14 03:48:52,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:52,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:52,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:52,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2019-01-14 03:48:52,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:52,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:52,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:52,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:48:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:52,185 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-14 03:48:52,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:48:52,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 03:48:52,426 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-01-14 03:48:52,427 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:48:52,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:48:52,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:48:52,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:48:52,428 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:48:52,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:52,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:48:52,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:48:52,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-14 03:48:52,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:48:52,429 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:48:52,430 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-14 03:48:52,438 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-14 03:48:52,459 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-14 03:48:52,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:48:52,611 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-14 03:48:52,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:48:52,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:48:52,619 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:48:52,620 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:52,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:48:52,643 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 03:48:52,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:48:52,714 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-14 03:48:53,034 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:48:53,036 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:48:53,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:48:53,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:48:53,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:48:53,037 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:48:53,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:53,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:48:53,037 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:48:53,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-14 03:48:53,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:48:53,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:48:53,041 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-14 03:48:53,046 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-14 03:48:53,067 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-14 03:48:53,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:48:53,148 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:48:53,148 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-14 03:48:53,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:53,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:53,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:53,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:53,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:53,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:53,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:53,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:48:53,156 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-14 03:48:53,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:53,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:53,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:53,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:53,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:53,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:53,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:53,164 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:48:53,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:48:53,169 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:48:53,170 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:48:53,170 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:48:53,170 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:48:53,170 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-14 03:48:53,171 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:48:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:53,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:53,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:53,413 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-14 03:48:53,414 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-14 03:48:53,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-01-14 03:48:53,462 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-14 03:48:53,464 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-14 03:48:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:48:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2019-01-14 03:48:53,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2019-01-14 03:48:53,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:53,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2019-01-14 03:48:53,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:53,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2019-01-14 03:48:53,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:53,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2019-01-14 03:48:53,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2019-01-14 03:48:53,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2019-01-14 03:48:53,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-01-14 03:48:53,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-01-14 03:48:53,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2019-01-14 03:48:53,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:48:53,473 INFO L706 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-01-14 03:48:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2019-01-14 03:48:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2019-01-14 03:48:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 03:48:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-01-14 03:48:53,478 INFO L729 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-01-14 03:48:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:48:53,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:48:53,479 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-01-14 03:48:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:48:53,678 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-01-14 03:48:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:48:53,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2019-01-14 03:48:53,684 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-01-14 03:48:53,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2019-01-14 03:48:53,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-01-14 03:48:53,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-01-14 03:48:53,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2019-01-14 03:48:53,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:48:53,688 INFO L706 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-01-14 03:48:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2019-01-14 03:48:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2019-01-14 03:48:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 03:48:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-01-14 03:48:53,697 INFO L729 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-14 03:48:53,697 INFO L609 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-14 03:48:53,697 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:48:53,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-01-14 03:48:53,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-01-14 03:48:53,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:53,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:53,701 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:48:53,701 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:48:53,701 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-14 03:48:53,701 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-14 03:48:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:53,702 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2019-01-14 03:48:53,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:53,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:53,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:53,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2019-01-14 03:48:53,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:53,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:53,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:53,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:48:53,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:53,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:53,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2019-01-14 03:48:53,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:53,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:53,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:53,794 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-14 03:48:53,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:48:53,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 03:48:54,040 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-14 03:48:54,442 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-01-14 03:48:54,444 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:48:54,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:48:54,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:48:54,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:48:54,445 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:48:54,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:54,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:48:54,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:48:54,446 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-14 03:48:54,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:48:54,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:48:54,448 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-14 03:48:54,469 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-14 03:48:54,473 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-14 03:48:54,480 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-14 03:48:54,628 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:48:54,629 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-14 03:48:54,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:48:54,632 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-14 03:48:54,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:48:54,656 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:48:54,691 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:48:54,693 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:48:54,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:48:54,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:48:54,693 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:48:54,693 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:48:54,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:54,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:48:54,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:48:54,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-14 03:48:54,694 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:48:54,694 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:48:54,695 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-14 03:48:54,733 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-14 03:48:54,739 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-14 03:48:54,741 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-14 03:48:54,838 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:48:54,838 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:48:54,839 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-14 03:48:54,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:54,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:54,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:54,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:54,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:54,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:54,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:54,846 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:48:54,849 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:48:54,849 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:48:54,850 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:48:54,850 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:48:54,850 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:48:54,850 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-14 03:48:54,850 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:48:54,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:54,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:54,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:54,966 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-14 03:48:54,966 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-14 03:48:54,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 03:48:55,040 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-14 03:48:55,041 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-14 03:48:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:48:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2019-01-14 03:48:55,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2019-01-14 03:48:55,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:55,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2019-01-14 03:48:55,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:55,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2019-01-14 03:48:55,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:55,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-01-14 03:48:55,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-14 03:48:55,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2019-01-14 03:48:55,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-01-14 03:48:55,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-01-14 03:48:55,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2019-01-14 03:48:55,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:48:55,048 INFO L706 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-01-14 03:48:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2019-01-14 03:48:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-01-14 03:48:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 03:48:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-01-14 03:48:55,054 INFO L729 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-01-14 03:48:55,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:48:55,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:48:55,055 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 5 states. [2019-01-14 03:48:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:48:55,113 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-01-14 03:48:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:48:55,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 77 transitions. [2019-01-14 03:48:55,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-01-14 03:48:55,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 64 states and 74 transitions. [2019-01-14 03:48:55,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 03:48:55,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-14 03:48:55,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2019-01-14 03:48:55,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:48:55,116 INFO L706 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-01-14 03:48:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2019-01-14 03:48:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-14 03:48:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 03:48:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-01-14 03:48:55,120 INFO L729 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-01-14 03:48:55,120 INFO L609 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-01-14 03:48:55,120 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:48:55,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2019-01-14 03:48:55,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-01-14 03:48:55,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:55,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:55,121 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:48:55,121 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:48:55,121 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-14 03:48:55,122 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-14 03:48:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:55,122 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2019-01-14 03:48:55,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:55,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:55,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2019-01-14 03:48:55,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:55,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:55,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:55,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:55,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:55,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2019-01-14 03:48:55,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:55,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:55,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:55,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:48:55,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:55,331 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-14 03:48:55,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:48:55,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 03:48:55,434 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-14 03:48:55,745 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-01-14 03:48:55,747 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:48:55,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:48:55,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:48:55,747 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:48:55,747 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:48:55,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:55,747 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:48:55,747 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:48:55,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-14 03:48:55,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:48:55,748 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:48:55,749 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-14 03:48:55,752 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-14 03:48:55,754 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-14 03:48:55,830 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-14 03:48:55,940 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:48:55,940 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-14 03:48:55,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:48:55,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:48:55,948 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:48:55,948 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-14 03:48:55,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:48:55,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:48:55,973 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:48:55,974 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-14 03:48:55,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:48:55,996 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-14 03:48:56,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:48:56,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:48:56,329 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:48:56,332 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:48:56,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:48:56,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:48:56,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:48:56,332 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:48:56,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:48:56,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:48:56,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:48:56,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-14 03:48:56,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:48:56,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:48:56,336 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-14 03:48:56,341 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-14 03:48:56,347 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-14 03:48:56,349 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-14 03:48:56,490 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:48:56,490 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:48:56,490 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-14 03:48:56,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:56,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:56,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:56,492 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:48:56,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:56,495 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:48:56,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:56,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:48:56,499 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-14 03:48:56,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:56,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:56,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:56,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:56,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:56,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:56,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:56,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:48:56,506 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-14 03:48:56,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:56,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:56,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:56,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:56,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:56,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:56,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:56,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:48:56,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:48:56,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:48:56,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:48:56,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:48:56,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:48:56,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:48:56,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:48:56,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:48:56,522 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:48:56,526 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:48:56,527 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:48:56,527 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:48:56,527 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:48:56,527 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:48:56,527 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-14 03:48:56,528 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:48:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:56,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:56,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:56,676 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-14 03:48:56,676 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-14 03:48:56,677 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-14 03:48:56,830 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-14 03:48:56,832 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-14 03:48:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:48:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-01-14 03:48:56,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2019-01-14 03:48:56,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:56,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2019-01-14 03:48:56,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:56,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2019-01-14 03:48:56,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:48:56,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2019-01-14 03:48:56,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 03:48:56,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2019-01-14 03:48:56,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-14 03:48:56,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-14 03:48:56,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2019-01-14 03:48:56,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:48:56,848 INFO L706 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-01-14 03:48:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2019-01-14 03:48:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-01-14 03:48:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-14 03:48:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-01-14 03:48:56,863 INFO L729 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-01-14 03:48:56,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:48:56,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:48:56,864 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2019-01-14 03:48:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:48:57,296 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2019-01-14 03:48:57,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 03:48:57,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2019-01-14 03:48:57,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-01-14 03:48:57,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2019-01-14 03:48:57,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-01-14 03:48:57,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-01-14 03:48:57,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2019-01-14 03:48:57,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:48:57,306 INFO L706 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2019-01-14 03:48:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2019-01-14 03:48:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2019-01-14 03:48:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 03:48:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-01-14 03:48:57,311 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-01-14 03:48:57,311 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-01-14 03:48:57,311 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:48:57,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2019-01-14 03:48:57,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 03:48:57,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:57,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:57,313 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 03:48:57,313 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:48:57,313 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-14 03:48:57,314 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-14 03:48:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2019-01-14 03:48:57,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:57,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:57,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:57,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2019-01-14 03:48:57,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:57,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:57,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:57,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:57,400 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-14 03:48:57,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:48:57,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:48:57,401 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:48:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:48:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:48:57,402 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-01-14 03:48:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:48:57,564 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2019-01-14 03:48:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 03:48:57,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 238 transitions. [2019-01-14 03:48:57,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 03:48:57,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 198 states and 224 transitions. [2019-01-14 03:48:57,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 03:48:57,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 03:48:57,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 224 transitions. [2019-01-14 03:48:57,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:48:57,571 INFO L706 BuchiCegarLoop]: Abstraction has 198 states and 224 transitions. [2019-01-14 03:48:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 224 transitions. [2019-01-14 03:48:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 163. [2019-01-14 03:48:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-14 03:48:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2019-01-14 03:48:57,577 INFO L729 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-01-14 03:48:57,577 INFO L609 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-01-14 03:48:57,577 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:48:57,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2019-01-14 03:48:57,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 03:48:57,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:48:57,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:48:57,581 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 03:48:57,581 INFO L868 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-14 03:48:57,581 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-14 03:48:57,582 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-14 03:48:57,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:57,582 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2019-01-14 03:48:57,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:57,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:57,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:57,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2019-01-14 03:48:57,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:57,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:57,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:48:57,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:48:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:48:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2019-01-14 03:48:57,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:48:57,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:48:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:57,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:48:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:57,747 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-14 03:48:57,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:48:57,747 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-14 03:48:57,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:48:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:48:57,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:48:58,556 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-14 03:48:58,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:48:58,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-01-14 03:48:58,856 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-01-14 03:48:58,858 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-01-14 03:49:00,735 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-01-14 03:49:00,737 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:00,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:00,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:00,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:00,738 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:00,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:00,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:00,739 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:00,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2019-01-14 03:49:00,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:00,739 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:00,741 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-14 03:49:00,755 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-14 03:49:00,758 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-14 03:49:00,762 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-14 03:49:00,856 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:00,856 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-14 03:49:00,860 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:00,860 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-14 03:49:00,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:00,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:01,005 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:01,007 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:01,007 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:01,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:01,008 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:01,008 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:01,008 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:01,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:01,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:01,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2019-01-14 03:49:01,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:01,008 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:01,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:01,036 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-14 03:49:01,041 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-14 03:49:01,054 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-14 03:49:01,140 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:01,140 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:01,140 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-14 03:49:01,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:01,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:01,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:01,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:01,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:01,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:01,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:01,146 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:01,153 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 03:49:01,153 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 03:49:01,154 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:01,154 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:01,154 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:01,154 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-14 03:49:01,154 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:01,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:01,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:01,519 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-14 03:49:01,520 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-14 03:49:01,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-14 03:49:01,712 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-14 03:49:02,328 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-14 03:49:02,328 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-14 03:49:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 03:49:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2019-01-14 03:49:02,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 5 letters. Loop has 23 letters. [2019-01-14 03:49:02,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:02,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 28 letters. Loop has 23 letters. [2019-01-14 03:49:02,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:02,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 5 letters. Loop has 46 letters. [2019-01-14 03:49:02,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:02,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 811 states and 884 transitions. [2019-01-14 03:49:02,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-01-14 03:49:02,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 811 states to 644 states and 708 transitions. [2019-01-14 03:49:02,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-01-14 03:49:02,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-01-14 03:49:02,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 644 states and 708 transitions. [2019-01-14 03:49:02,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:02,347 INFO L706 BuchiCegarLoop]: Abstraction has 644 states and 708 transitions. [2019-01-14 03:49:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states and 708 transitions. [2019-01-14 03:49:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 409. [2019-01-14 03:49:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-01-14 03:49:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2019-01-14 03:49:02,357 INFO L729 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2019-01-14 03:49:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 03:49:02,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-14 03:49:02,358 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 12 states. [2019-01-14 03:49:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:49:03,147 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2019-01-14 03:49:03,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 03:49:03,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2019-01-14 03:49:03,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 03:49:03,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2019-01-14 03:49:03,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 03:49:03,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:49:03,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2019-01-14 03:49:03,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:03,157 INFO L706 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2019-01-14 03:49:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2019-01-14 03:49:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2019-01-14 03:49:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 03:49:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2019-01-14 03:49:03,162 INFO L729 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-01-14 03:49:03,162 INFO L609 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-01-14 03:49:03,162 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 03:49:03,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2019-01-14 03:49:03,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 03:49:03,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:03,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:03,165 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:49:03,165 INFO L868 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-14 03:49:03,165 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-14 03:49:03,165 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-14 03:49:03,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:03,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2019-01-14 03:49:03,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:03,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:03,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:03,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:03,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:03,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:03,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2019-01-14 03:49:03,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:03,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:03,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2019-01-14 03:49:03,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:03,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:03,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:49:03,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:03,492 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-01-14 03:49:03,493 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-01-14 03:49:04,315 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-01-14 03:49:04,317 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:04,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:04,318 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:04,318 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:04,318 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:04,318 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:04,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:04,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:04,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2019-01-14 03:49:04,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:04,319 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:04,320 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-14 03:49:04,327 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-14 03:49:04,329 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-14 03:49:04,334 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-14 03:49:04,432 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:04,433 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-14 03:49:04,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:04,440 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:04,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:49:04,444 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-14 03:49:04,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:04,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:04,466 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:49:04,466 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-14 03:49:04,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:04,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:04,492 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:49:04,492 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-14 03:49:04,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:04,515 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-14 03:49:04,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:04,542 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:04,652 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:04,654 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:04,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:04,654 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:04,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:04,654 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:04,654 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:04,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:04,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:04,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2019-01-14 03:49:04,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:04,655 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:04,657 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-14 03:49:04,664 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-14 03:49:04,669 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-14 03:49:04,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-14 03:49:04,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:04,760 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:04,761 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-14 03:49:04,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:04,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:04,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:04,764 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:49:04,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:04,765 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:49:04,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:04,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:49:04,768 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-14 03:49:04,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:04,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:04,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:04,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:04,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:04,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:04,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:04,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:49:04,780 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-14 03:49:04,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:04,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:04,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:04,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:04,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:04,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:04,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:04,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:49:04,789 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-14 03:49:04,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:04,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:04,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:04,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:04,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:04,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:04,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:04,801 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:04,810 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:49:04,810 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 03:49:04,811 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:04,811 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:04,811 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:04,811 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-14 03:49:04,811 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:04,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:04,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:05,190 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-14 03:49:05,190 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-14 03:49:05,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-14 03:49:05,335 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-14 03:49:05,336 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-14 03:49:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 03:49:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2019-01-14 03:49:05,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 17 letters. Loop has 23 letters. [2019-01-14 03:49:05,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:05,337 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:05,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:05,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:05,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:05,441 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-14 03:49:05,442 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-14 03:49:05,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-14 03:49:05,774 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-14 03:49:05,775 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-14 03:49:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 03:49:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2019-01-14 03:49:05,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 17 letters. Loop has 23 letters. [2019-01-14 03:49:05,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:05,776 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:05,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:05,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:05,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:05,896 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-14 03:49:05,896 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-14 03:49:05,896 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-14 03:49:06,113 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-14 03:49:06,114 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-14 03:49:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 03:49:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2019-01-14 03:49:06,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 104 transitions. Stem has 17 letters. Loop has 23 letters. [2019-01-14 03:49:06,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:06,116 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:06,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:06,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:06,225 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-14 03:49:06,225 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-14 03:49:06,226 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-14 03:49:06,915 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-14 03:49:06,917 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-14 03:49:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 03:49:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2019-01-14 03:49:06,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 23 letters. [2019-01-14 03:49:06,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:06,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 40 letters. Loop has 23 letters. [2019-01-14 03:49:06,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:06,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 46 letters. [2019-01-14 03:49:06,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:06,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 699 states and 769 transitions. [2019-01-14 03:49:06,935 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:49:06,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 699 states to 0 states and 0 transitions. [2019-01-14 03:49:06,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:49:06,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:49:06,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:49:06,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:49:06,936 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:06,936 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:06,936 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:06,936 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 03:49:06,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:49:06,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:49:06,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:49:06,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:49:06 BoogieIcfgContainer [2019-01-14 03:49:06,949 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:49:06,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:49:06,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:49:06,950 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:49:06,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:48:49" (3/4) ... [2019-01-14 03:49:06,960 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:49:06,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:49:06,962 INFO L168 Benchmark]: Toolchain (without parser) took 18815.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 951.4 MB in the beginning and 982.2 MB in the end (delta: -30.9 MB). Peak memory consumption was 282.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:06,964 INFO L168 Benchmark]: CDTParser took 0.15 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-14 03:49:06,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.38 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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-14 03:49:06,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.22 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-14 03:49:06,967 INFO L168 Benchmark]: Boogie Preprocessor took 42.84 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:06,969 INFO L168 Benchmark]: RCFGBuilder took 662.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:06,971 INFO L168 Benchmark]: BuchiAutomizer took 17719.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 982.2 MB in the end (delta: 129.3 MB). Peak memory consumption was 294.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:06,972 INFO L168 Benchmark]: Witness Printer took 10.50 ms. Allocated memory is still 1.3 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:49:06,980 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.38 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 63.22 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 42.84 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 662.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17719.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 982.2 MB in the end (delta: 129.3 MB). Peak memory consumption was 294.5 MB. Max. memory is 11.5 GB. * Witness Printer took 10.50 ms. Allocated memory is still 1.3 GB. Free memory is still 982.2 MB. 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 17.6s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 10.8s. Construction of modules took 3.0s. Büchi inclusion checks took 3.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, 1292 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s 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: 8ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...