./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.23-aa41828 [2018-11-23 07:21:30,218 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:21:30,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:21:30,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:21:30,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:21:30,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:21:30,227 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:21:30,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:21:30,229 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:21:30,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:21:30,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:21:30,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:21:30,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:21:30,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:21:30,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:21:30,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:21:30,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:21:30,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:21:30,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:21:30,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:21:30,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:21:30,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:21:30,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:21:30,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:21:30,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:21:30,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:21:30,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:21:30,245 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:21:30,246 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:21:30,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:21:30,247 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:21:30,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:21:30,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:21:30,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:21:30,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:21:30,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:21:30,249 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 07:21:30,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:21:30,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:21:30,261 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:21:30,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:21:30,261 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:21:30,261 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:21:30,262 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:21:30,262 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:21:30,262 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:21:30,262 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:21:30,262 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:21:30,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:21:30,263 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:21:30,263 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:21:30,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:21:30,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:21:30,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:21:30,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:21:30,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:21:30,264 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:21:30,264 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:21:30,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:21:30,264 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:21:30,264 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:21:30,264 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:21:30,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:21:30,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:21:30,265 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:21:30,265 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:21:30,265 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:21:30,265 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:21:30,266 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:21:30,266 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2018-11-23 07:21:30,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:21:30,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:21:30,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:21:30,302 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:21:30,303 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:21:30,303 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-23 07:21:30,354 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/data/cafadca89/72f315daef3b4ba981fe9a6c1d0cc5ba/FLAGe75645452 [2018-11-23 07:21:30,687 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:21:30,688 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-23 07:21:30,693 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/data/cafadca89/72f315daef3b4ba981fe9a6c1d0cc5ba/FLAGe75645452 [2018-11-23 07:21:31,114 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/data/cafadca89/72f315daef3b4ba981fe9a6c1d0cc5ba [2018-11-23 07:21:31,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:21:31,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:21:31,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:21:31,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:21:31,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:21:31,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7f20df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31, skipping insertion in model container [2018-11-23 07:21:31,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:21:31,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:21:31,246 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:21:31,249 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:21:31,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:21:31,270 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:21:31,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31 WrapperNode [2018-11-23 07:21:31,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:21:31,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:21:31,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:21:31,271 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:21:31,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:21:31,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:21:31,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:21:31,294 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:21:31,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... [2018-11-23 07:21:31,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:21:31,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:21:31,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:21:31,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:21:31,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:21:31,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:21:31,546 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:21:31,546 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 07:21:31,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:21:31 BoogieIcfgContainer [2018-11-23 07:21:31,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:21:31,547 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:21:31,547 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:21:31,549 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:21:31,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:21:31,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:21:31" (1/3) ... [2018-11-23 07:21:31,550 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a7ed93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:21:31, skipping insertion in model container [2018-11-23 07:21:31,550 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:21:31,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:21:31" (2/3) ... [2018-11-23 07:21:31,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a7ed93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:21:31, skipping insertion in model container [2018-11-23 07:21:31,551 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:21:31,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:21:31" (3/3) ... [2018-11-23 07:21:31,552 INFO L375 chiAutomizerObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-23 07:21:31,596 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:21:31,597 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:21:31,597 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:21:31,597 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:21:31,597 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:21:31,597 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:21:31,598 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:21:31,598 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:21:31,598 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:21:31,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-11-23 07:21:31,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-23 07:21:31,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:31,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:31,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:21:31,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:31,630 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:21:31,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-11-23 07:21:31,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-23 07:21:31,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:31,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:31,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:21:31,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:31,637 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 [2018-11-23 07:21:31,637 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 [2018-11-23 07:21:31,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2018-11-23 07:21:31,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:31,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:31,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:31,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:31,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2018-11-23 07:21:31,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:31,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:31,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:31,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:31,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:21:31,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:21:31,748 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:21:31,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:21:31,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:21:31,758 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-23 07:21:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:21:31,764 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 07:21:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:21:31,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2018-11-23 07:21:31,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-23 07:21:31,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2018-11-23 07:21:31,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-23 07:21:31,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 07:21:31,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-23 07:21:31,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:21:31,771 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 07:21:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-23 07:21:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 07:21:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 07:21:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 07:21:31,796 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 07:21:31,796 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 07:21:31,796 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:21:31,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-23 07:21:31,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-23 07:21:31,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:31,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:31,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:21:31,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:31,798 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 [2018-11-23 07:21:31,798 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 [2018-11-23 07:21:31,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2018-11-23 07:21:31,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:31,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:31,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:31,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:31,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2018-11-23 07:21:31,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:31,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:31,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:21:31,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:31,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:21:31,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:21:31,850 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:21:31,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 07:21:31,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 07:21:31,851 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 07:21:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:21:31,974 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-23 07:21:31,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:21:31,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2018-11-23 07:21:31,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-23 07:21:31,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2018-11-23 07:21:31,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-23 07:21:31,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-23 07:21:31,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2018-11-23 07:21:31,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:21:31,977 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-11-23 07:21:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2018-11-23 07:21:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2018-11-23 07:21:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 07:21:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 07:21:31,980 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 07:21:31,980 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 07:21:31,980 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:21:31,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2018-11-23 07:21:31,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-23 07:21:31,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:31,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:31,981 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:21:31,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:31,982 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 [2018-11-23 07:21:31,982 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 [2018-11-23 07:21:31,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2018-11-23 07:21:31,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:31,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:31,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2018-11-23 07:21:31,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:21:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:32,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2018-11-23 07:21:32,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:32,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:32,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:32,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:32,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:32,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:21:32,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:21:32,123 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:32,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:32,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:32,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:32,124 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:21:32,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:32,124 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:32,124 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:32,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-23 07:21:32,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:32,125 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:32,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,220 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:32,220 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:32,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:32,224 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:32,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:21:32,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:32,475 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:21:32,477 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:32,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:32,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:32,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:32,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:21:32,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:32,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:32,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:32,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-23 07:21:32,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:32,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:32,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,533 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:32,536 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:21:32,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:32,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:32,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:32,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:32,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:32,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:32,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:32,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:32,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:32,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:32,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:32,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:32,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:32,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:32,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:32,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:32,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:32,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:32,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:32,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:32,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:32,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:32,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:32,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:32,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:32,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:32,555 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:21:32,562 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:21:32,562 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:21:32,564 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:21:32,564 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:21:32,564 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:21:32,565 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-11-23 07:21:32,565 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:21:32,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:32,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:32,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:32,612 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:21:32,612 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 07:21:32,644 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. [2018-11-23 07:21:32,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:21:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:21:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-23 07:21:32,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2018-11-23 07:21:32,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:32,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-23 07:21:32,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:32,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-23 07:21:32,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:32,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2018-11-23 07:21:32,650 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-11-23 07:21:32,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2018-11-23 07:21:32,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-23 07:21:32,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-23 07:21:32,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2018-11-23 07:21:32,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:32,652 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2018-11-23 07:21:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2018-11-23 07:21:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 07:21:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 07:21:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2018-11-23 07:21:32,656 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2018-11-23 07:21:32,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:21:32,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:21:32,657 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2018-11-23 07:21:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:21:32,668 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2018-11-23 07:21:32,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:21:32,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2018-11-23 07:21:32,670 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2018-11-23 07:21:32,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2018-11-23 07:21:32,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-11-23 07:21:32,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2018-11-23 07:21:32,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2018-11-23 07:21:32,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:21:32,671 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-11-23 07:21:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2018-11-23 07:21:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2018-11-23 07:21:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 07:21:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-11-23 07:21:32,675 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-11-23 07:21:32,675 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-11-23 07:21:32,675 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:21:32,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2018-11-23 07:21:32,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-23 07:21:32,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:32,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:32,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:21:32,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:32,677 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 [2018-11-23 07:21:32,677 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 [2018-11-23 07:21:32,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:32,677 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2018-11-23 07:21:32,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:32,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:32,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:32,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2018-11-23 07:21:32,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:32,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:32,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:32,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:32,693 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2018-11-23 07:21:32,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:32,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:32,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:32,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:21:32,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:32,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:21:32,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:21:32,811 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:32,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:32,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:32,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:32,812 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:21:32,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:32,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:32,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:32,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-23 07:21:32,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:32,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:32,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:32,874 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:32,874 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:32,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:32,877 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:32,880 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:21:32,880 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 /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:32,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:32,900 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:32,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:21:32,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:33,102 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:21:33,104 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:33,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:33,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:33,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:33,104 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:21:33,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:33,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:33,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:33,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-23 07:21:33,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:33,105 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:33,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,151 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:33,151 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:21:33,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:33,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:33,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:33,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:33,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:33,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:33,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:33,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:33,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:33,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:33,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:33,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:33,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:33,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:33,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:33,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:33,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:33,160 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:21:33,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:21:33,163 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:21:33,164 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:21:33,164 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:21:33,164 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:21:33,164 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-11-23 07:21:33,164 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:21:33,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:33,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:33,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:33,196 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:21:33,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-23 07:21:33,213 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. [2018-11-23 07:21:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:21:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:21:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-23 07:21:33,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2018-11-23 07:21:33,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:33,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-23 07:21:33,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:33,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-23 07:21:33,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:33,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2018-11-23 07:21:33,217 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2018-11-23 07:21:33,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2018-11-23 07:21:33,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-11-23 07:21:33,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2018-11-23 07:21:33,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2018-11-23 07:21:33,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:33,219 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-11-23 07:21:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2018-11-23 07:21:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2018-11-23 07:21:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 07:21:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-23 07:21:33,222 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-23 07:21:33,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:21:33,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:21:33,223 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2018-11-23 07:21:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:21:33,316 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2018-11-23 07:21:33,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:21:33,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2018-11-23 07:21:33,320 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2018-11-23 07:21:33,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2018-11-23 07:21:33,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2018-11-23 07:21:33,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2018-11-23 07:21:33,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2018-11-23 07:21:33,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:33,322 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-11-23 07:21:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2018-11-23 07:21:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2018-11-23 07:21:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 07:21:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-11-23 07:21:33,326 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-11-23 07:21:33,326 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-11-23 07:21:33,326 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:21:33,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2018-11-23 07:21:33,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-23 07:21:33,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:33,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:33,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:21:33,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:33,328 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 [2018-11-23 07:21:33,328 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 [2018-11-23 07:21:33,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2018-11-23 07:21:33,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:33,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:33,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:33,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2018-11-23 07:21:33,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:33,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:21:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:33,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:33,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2018-11-23 07:21:33,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:33,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:33,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:33,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:21:33,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:21:33,513 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:33,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:33,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:33,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:33,513 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:21:33,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:33,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:33,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:33,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-23 07:21:33,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:33,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:33,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,601 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:33,601 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:33,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:33,609 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:33,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:21:33,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:33,651 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:21:33,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:33,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:33,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:33,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:33,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:21:33,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:33,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:33,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:33,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-23 07:21:33,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:33,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:33,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:33,728 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:33,728 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:21:33,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:33,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:33,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:33,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:33,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:33,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:33,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:33,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:33,731 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:21:33,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:21:33,734 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:21:33,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:21:33,734 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:21:33,734 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:21:33,734 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-11-23 07:21:33,735 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:21:33,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:33,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:33,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:33,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:21:33,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 07:21:33,795 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. [2018-11-23 07:21:33,796 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 [2018-11-23 07:21:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:21:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-23 07:21:33,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2018-11-23 07:21:33,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:33,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2018-11-23 07:21:33,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:33,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2018-11-23 07:21:33,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:33,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2018-11-23 07:21:33,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-23 07:21:33,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2018-11-23 07:21:33,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-23 07:21:33,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-11-23 07:21:33,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2018-11-23 07:21:33,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:33,799 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2018-11-23 07:21:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2018-11-23 07:21:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-11-23 07:21:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 07:21:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2018-11-23 07:21:33,802 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2018-11-23 07:21:33,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:21:33,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:21:33,802 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 5 states. [2018-11-23 07:21:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:21:33,834 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-11-23 07:21:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:21:33,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 77 transitions. [2018-11-23 07:21:33,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-23 07:21:33,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 64 states and 74 transitions. [2018-11-23 07:21:33,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 07:21:33,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-23 07:21:33,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2018-11-23 07:21:33,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:33,835 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-11-23 07:21:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2018-11-23 07:21:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 07:21:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 07:21:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-11-23 07:21:33,837 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-11-23 07:21:33,837 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-11-23 07:21:33,837 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:21:33,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2018-11-23 07:21:33,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-23 07:21:33,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:33,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:33,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:21:33,839 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:33,839 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 [2018-11-23 07:21:33,839 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 [2018-11-23 07:21:33,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2018-11-23 07:21:33,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:33,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:33,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:33,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:33,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2018-11-23 07:21:33,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:33,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:33,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2018-11-23 07:21:33,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:33,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:21:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:21:33,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:21:34,037 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:34,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:34,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:34,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:34,037 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:21:34,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:34,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:34,038 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:34,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-23 07:21:34,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:34,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:34,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:34,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:34,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:34,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:34,122 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:34,122 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:34,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:34,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:34,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:21:34,130 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 /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:34,147 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:34,147 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:34,149 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:21:34,149 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 /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:34,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:34,166 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:34,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:21:34,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:34,449 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:21:34,451 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:34,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:34,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:34,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:34,452 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:21:34,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:34,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:34,452 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:34,452 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-23 07:21:34,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:34,452 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:34,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:34,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:34,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:34,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:34,502 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:34,503 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:21:34,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:34,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:34,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:34,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:34,504 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:21:34,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:34,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:21:34,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:34,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:34,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 [2018-11-23 07:21:34,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:34,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:34,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:34,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:34,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:34,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:34,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:34,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:34,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:34,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:34,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:34,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:34,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:34,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:34,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:34,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:34,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:34,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 [2018-11-23 07:21:34,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:34,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:34,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:34,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:34,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:34,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:34,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:34,513 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:21:34,515 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:21:34,515 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:21:34,516 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:21:34,516 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:21:34,516 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:21:34,516 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-11-23 07:21:34,516 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:21:34,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:34,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:34,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:34,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:21:34,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 07:21:34,575 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. [2018-11-23 07:21:34,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:21:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:21:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-23 07:21:34,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2018-11-23 07:21:34,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:34,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2018-11-23 07:21:34,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:34,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2018-11-23 07:21:34,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:34,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2018-11-23 07:21:34,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 07:21:34,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2018-11-23 07:21:34,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 07:21:34,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 07:21:34,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2018-11-23 07:21:34,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:34,580 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2018-11-23 07:21:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2018-11-23 07:21:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-23 07:21:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 07:21:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-11-23 07:21:34,583 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-11-23 07:21:34,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:21:34,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:21:34,584 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2018-11-23 07:21:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:21:34,671 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2018-11-23 07:21:34,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:21:34,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2018-11-23 07:21:34,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2018-11-23 07:21:34,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2018-11-23 07:21:34,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-11-23 07:21:34,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-11-23 07:21:34,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2018-11-23 07:21:34,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:34,674 INFO L705 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2018-11-23 07:21:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2018-11-23 07:21:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2018-11-23 07:21:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 07:21:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2018-11-23 07:21:34,676 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2018-11-23 07:21:34,676 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2018-11-23 07:21:34,676 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 07:21:34,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2018-11-23 07:21:34,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 07:21:34,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:34,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:34,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 07:21:34,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:34,677 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 [2018-11-23 07:21:34,677 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 [2018-11-23 07:21:34,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:34,677 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2018-11-23 07:21:34,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:34,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:34,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:34,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:34,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2018-11-23 07:21:34,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:34,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:34,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:34,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:34,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:21:34,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 07:21:34,715 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:21:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:21:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:21:34,715 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2018-11-23 07:21:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:21:34,784 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2018-11-23 07:21:34,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:21:34,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 238 transitions. [2018-11-23 07:21:34,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 07:21:34,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 198 states and 224 transitions. [2018-11-23 07:21:34,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:21:34,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:21:34,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 224 transitions. [2018-11-23 07:21:34,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:34,786 INFO L705 BuchiCegarLoop]: Abstraction has 198 states and 224 transitions. [2018-11-23 07:21:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 224 transitions. [2018-11-23 07:21:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 163. [2018-11-23 07:21:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 07:21:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2018-11-23 07:21:34,792 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2018-11-23 07:21:34,792 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2018-11-23 07:21:34,792 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 07:21:34,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2018-11-23 07:21:34,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 07:21:34,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:34,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:34,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 07:21:34,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:34,794 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 [2018-11-23 07:21:34,794 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 [2018-11-23 07:21:34,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2018-11-23 07:21:34,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:34,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:34,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:34,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:34,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2018-11-23 07:21:34,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:34,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:21:34,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:34,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2018-11-23 07:21:34,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:34,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:34,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:34,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:34,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:21:34,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:34,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:35,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 07:21:35,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-11-23 07:21:35,211 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-23 07:21:35,212 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-11-23 07:21:35,769 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2018-11-23 07:21:35,770 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:35,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:35,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:35,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:35,770 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:21:35,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:35,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:35,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:35,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-23 07:21:35,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:35,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:35,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:35,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:35,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:35,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:35,818 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:35,818 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:35,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:35,819 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:35,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:21:35,838 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:35,941 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:21:35,942 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:35,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:35,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:35,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:35,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:21:35,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:35,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:35,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:35,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-23 07:21:35,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:35,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:35,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:35,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:35,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:35,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:35,992 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:35,992 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:21:35,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:35,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:35,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:35,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:35,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:35,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:35,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:35,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:35,995 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:21:36,000 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 07:21:36,000 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 07:21:36,000 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:21:36,000 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:21:36,001 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:21:36,001 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 [] [2018-11-23 07:21:36,001 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:21:36,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:36,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:36,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:36,091 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 07:21:36,091 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-23 07:21:36,319 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. [2018-11-23 07:21:36,320 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 [2018-11-23 07:21:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 07:21:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2018-11-23 07:21:36,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 5 letters. Loop has 23 letters. [2018-11-23 07:21:36,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:36,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 28 letters. Loop has 23 letters. [2018-11-23 07:21:36,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:36,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 5 letters. Loop has 46 letters. [2018-11-23 07:21:36,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:36,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 811 states and 884 transitions. [2018-11-23 07:21:36,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-11-23 07:21:36,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 811 states to 644 states and 708 transitions. [2018-11-23 07:21:36,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-23 07:21:36,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-23 07:21:36,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 644 states and 708 transitions. [2018-11-23 07:21:36,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:36,332 INFO L705 BuchiCegarLoop]: Abstraction has 644 states and 708 transitions. [2018-11-23 07:21:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states and 708 transitions. [2018-11-23 07:21:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 409. [2018-11-23 07:21:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-23 07:21:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2018-11-23 07:21:36,340 INFO L728 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2018-11-23 07:21:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 07:21:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:21:36,341 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 12 states. [2018-11-23 07:21:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:21:39,432 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2018-11-23 07:21:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 07:21:39,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2018-11-23 07:21:39,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 07:21:39,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2018-11-23 07:21:39,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 07:21:39,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 07:21:39,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2018-11-23 07:21:39,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:21:39,436 INFO L705 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2018-11-23 07:21:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2018-11-23 07:21:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2018-11-23 07:21:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 07:21:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2018-11-23 07:21:39,440 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2018-11-23 07:21:39,440 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2018-11-23 07:21:39,440 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 07:21:39,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2018-11-23 07:21:39,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 07:21:39,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:21:39,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:21:39,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:39,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:21:39,442 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 [2018-11-23 07:21:39,442 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 [2018-11-23 07:21:39,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:39,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2018-11-23 07:21:39,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:39,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:39,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:39,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:39,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2018-11-23 07:21:39,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:39,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:39,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:39,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:21:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:39,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:39,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2018-11-23 07:21:39,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:21:39,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:21:39,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:39,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:21:39,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:21:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:21:39,606 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-23 07:21:39,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-11-23 07:21:39,950 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:39,951 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:39,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:39,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:39,951 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:21:39,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:39,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:39,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:39,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-23 07:21:39,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:39,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:39,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:39,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:39,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:39,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:40,005 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:40,005 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:40,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:40,010 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:40,012 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:21:40,012 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 /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:40,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:40,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:40,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:21:40,030 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 /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:40,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:40,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:40,049 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:21:40,049 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 /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:40,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:21:40,064 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5341af80-58f3-43a6-9db6-76e99425bd3a/bin-2019/uautomizer/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 [2018-11-23 07:21:40,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:21:40,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:21:40,162 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:21:40,164 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:21:40,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:21:40,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:21:40,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:21:40,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:21:40,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:21:40,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:21:40,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:21:40,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-23 07:21:40,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:21:40,165 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:21:40,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:40,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:40,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:40,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:21:40,208 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:21:40,208 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:21:40,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:40,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:40,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:40,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:40,209 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:21:40,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:40,209 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:21:40,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:40,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:40,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:40,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:40,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:40,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:40,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:40,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:40,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:40,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:40,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:40,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:40,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:40,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:40,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:40,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:40,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:40,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:40,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:40,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:21:40,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:21:40,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:21:40,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:21:40,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:21:40,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:21:40,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:21:40,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:21:40,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:21:40,217 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:21:40,221 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 07:21:40,221 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 07:21:40,221 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:21:40,221 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:21:40,222 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:21:40,222 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 [] [2018-11-23 07:21:40,222 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:21:40,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:40,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:40,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:40,315 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 07:21:40,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-11-23 07:21:40,379 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. [2018-11-23 07:21:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 07:21:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:21:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-23 07:21:40,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 17 letters. Loop has 23 letters. [2018-11-23 07:21:40,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:40,380 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:21:40,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:40,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:40,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:40,449 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 [2018-11-23 07:21:40,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-11-23 07:21:40,531 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. [2018-11-23 07:21:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 07:21:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:21:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-23 07:21:40,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 17 letters. Loop has 23 letters. [2018-11-23 07:21:40,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:40,533 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:21:40,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:40,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:40,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:40,614 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 [2018-11-23 07:21:40,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-11-23 07:21:40,722 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. [2018-11-23 07:21:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 07:21:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:21:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-11-23 07:21:40,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 104 transitions. Stem has 17 letters. Loop has 23 letters. [2018-11-23 07:21:40,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:40,723 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:21:40,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:21:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:40,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:21:40,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:21:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:21:40,793 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 [2018-11-23 07:21:40,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-11-23 07:21:40,933 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. [2018-11-23 07:21:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 07:21:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:21:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-23 07:21:40,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 23 letters. [2018-11-23 07:21:40,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:40,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 40 letters. Loop has 23 letters. [2018-11-23 07:21:40,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:40,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 46 letters. [2018-11-23 07:21:40,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:21:40,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 699 states and 769 transitions. [2018-11-23 07:21:40,939 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:21:40,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 699 states to 0 states and 0 transitions. [2018-11-23 07:21:40,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 07:21:40,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 07:21:40,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 07:21:40,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:21:40,940 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:21:40,940 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:21:40,940 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:21:40,940 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 07:21:40,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:21:40,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:21:40,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 07:21:40,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:21:40 BoogieIcfgContainer [2018-11-23 07:21:40,946 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:21:40,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:21:40,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:21:40,947 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:21:40,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:21:31" (3/4) ... [2018-11-23 07:21:40,951 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:21:40,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:21:40,951 INFO L168 Benchmark]: Toolchain (without parser) took 9834.68 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -63.1 MB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:21:40,952 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:21:40,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.21 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:21:40,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.07 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:21:40,953 INFO L168 Benchmark]: Boogie Preprocessor took 15.96 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 942.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:21:40,954 INFO L168 Benchmark]: RCFGBuilder took 236.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:21:40,954 INFO L168 Benchmark]: BuchiAutomizer took 9399.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.2 MB). Peak memory consumption was 266.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:21:40,955 INFO L168 Benchmark]: Witness Printer took 3.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:21:40,958 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.21 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.07 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.96 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 942.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9399.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.2 MB). Peak memory consumption was 266.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (8 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function 5 * r + -8 * j and consists of 10 locations. One nondeterministic module has affine ranking function r + -1 * j and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 3.6s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 849 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 210 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 0, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 785 SDtfs, 1359 SDslu, 1002 SDs, 0 SdLazy, 1291 SolverSat, 167 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.6s 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: 2ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...