./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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.24-6b5699a [2019-11-25 08:45:23,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:23,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:23,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:23,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:23,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:23,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:23,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:23,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:23,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:23,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:23,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:23,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:23,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:23,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:23,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:23,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:23,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:23,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:23,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:23,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:23,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:23,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:23,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:23,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:23,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:23,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:23,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:23,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:23,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:23,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:23,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:23,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:23,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:23,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:23,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:23,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:23,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:23,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:23,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:23,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:23,268 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:45:23,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:23,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:23,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:23,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:23,296 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:23,297 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:45:23,297 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:45:23,297 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:45:23,297 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:45:23,297 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:45:23,297 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:45:23,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:23,298 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:45:23,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:45:23,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:45:23,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:45:23,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:23,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:45:23,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:45:23,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:45:23,299 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:45:23,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:23,300 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:45:23,300 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:23,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:45:23,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:23,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:23,301 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:45:23,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:23,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:45:23,301 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:45:23,302 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:45:23,302 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:23,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:23,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:23,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:23,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:23,470 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:23,471 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-25 08:45:23,520 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/data/e62ec759d/727a7d70d49b4a93afefea7fc923d55b/FLAG8af0e0d25 [2019-11-25 08:45:23,947 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:23,947 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-25 08:45:23,954 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/data/e62ec759d/727a7d70d49b4a93afefea7fc923d55b/FLAG8af0e0d25 [2019-11-25 08:45:24,313 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/data/e62ec759d/727a7d70d49b4a93afefea7fc923d55b [2019-11-25 08:45:24,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:24,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:24,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:24,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:24,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b66174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24, skipping insertion in model container [2019-11-25 08:45:24,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:24,352 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:24,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,506 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:45:24,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,597 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:45:24,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24 WrapperNode [2019-11-25 08:45:24,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:45:24,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:45:24,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:45:24,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:45:24,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:45:24,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:45:24,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:45:24,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:45:24,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:45:25,046 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:45:25,046 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-25 08:45:25,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25 BoogieIcfgContainer [2019-11-25 08:45:25,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:45:25,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:45:25,051 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:45:25,054 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:45:25,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:45:25,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:45:24" (1/3) ... [2019-11-25 08:45:25,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70f87cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:45:25,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (2/3) ... [2019-11-25 08:45:25,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70f87cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:45:25,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/3) ... [2019-11-25 08:45:25,064 INFO L371 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2019-11-25 08:45:25,101 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:45:25,101 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:45:25,101 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:45:25,101 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:45:25,101 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:45:25,101 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:45:25,102 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:45:25,102 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:45:25,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-25 08:45:25,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-25 08:45:25,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:25,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:25,142 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:45:25,142 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:25,142 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:45:25,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-25 08:45:25,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-25 08:45:25,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:25,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:25,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:45:25,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:25,152 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 55#L13true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 31#L16true assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 40#L45-1true [2019-11-25 08:45:25,153 INFO L796 eck$LassoCheckResult]: Loop: 40#L45-1true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 53#L24-2true assume !true; 52#L24-3true assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 32#L4-30true assume !(0 == __VERIFIER_assert_~cond); 44#L4-32true __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 42#L4-33true assume !(0 == __VERIFIER_assert_~cond); 39#L4-35true main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 40#L45-1true [2019-11-25 08:45:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-11-25 08:45:25,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703995753] [2019-11-25 08:45:25,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2019-11-25 08:45:25,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041296558] [2019-11-25 08:45:25,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:25,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041296558] [2019-11-25 08:45:25,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:25,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:25,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108611164] [2019-11-25 08:45:25,299 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:45:25,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:45:25,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:45:25,314 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-11-25 08:45:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:25,323 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-11-25 08:45:25,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:45:25,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2019-11-25 08:45:25,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-25 08:45:25,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2019-11-25 08:45:25,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-25 08:45:25,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-25 08:45:25,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-11-25 08:45:25,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:25,334 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-25 08:45:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-11-25 08:45:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-25 08:45:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:45:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-25 08:45:25,356 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-25 08:45:25,356 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-25 08:45:25,357 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:45:25,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-25 08:45:25,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-25 08:45:25,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:25,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:25,358 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:45:25,359 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:25,359 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 116#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 117#L45-1 [2019-11-25 08:45:25,359 INFO L796 eck$LassoCheckResult]: Loop: 117#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 124#L24-2 assume !(main_~j~0 <= main_~r~0); 144#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 129#L4-36 assume !(0 == __VERIFIER_assert_~cond); 130#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 143#L4-39 assume !(0 == __VERIFIER_assert_~cond); 141#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 117#L45-1 [2019-11-25 08:45:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2019-11-25 08:45:25,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891673664] [2019-11-25 08:45:25,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2019-11-25 08:45:25,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114025913] [2019-11-25 08:45:25,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:25,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114025913] [2019-11-25 08:45:25,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:25,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:25,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383269500] [2019-11-25 08:45:25,427 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:45:25,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:25,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:25,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:25,428 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-25 08:45:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:25,587 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-11-25 08:45:25,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:45:25,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2019-11-25 08:45:25,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-25 08:45:25,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2019-11-25 08:45:25,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-25 08:45:25,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-11-25 08:45:25,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2019-11-25 08:45:25,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:25,594 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-11-25 08:45:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2019-11-25 08:45:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2019-11-25 08:45:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-25 08:45:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-25 08:45:25,598 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-25 08:45:25,598 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-25 08:45:25,598 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:45:25,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-11-25 08:45:25,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-25 08:45:25,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:25,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:25,600 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:45:25,600 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:25,600 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 264#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 230#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 231#L45-1 [2019-11-25 08:45:25,604 INFO L796 eck$LassoCheckResult]: Loop: 231#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 247#L24-2 assume !(main_~j~0 <= main_~r~0); 262#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 234#L4-30 assume !(0 == __VERIFIER_assert_~cond); 235#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 250#L4-33 assume !(0 == __VERIFIER_assert_~cond); 246#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 231#L45-1 [2019-11-25 08:45:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2019-11-25 08:45:25,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119344107] [2019-11-25 08:45:25,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:25,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2019-11-25 08:45:25,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937355928] [2019-11-25 08:45:25,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2019-11-25 08:45:25,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239670085] [2019-11-25 08:45:25,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:25,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239670085] [2019-11-25 08:45:25,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:25,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:25,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192207270] [2019-11-25 08:45:25,816 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:25,817 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:25,817 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:25,818 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:25,818 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:45:25,818 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:25,818 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:25,818 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:25,818 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-25 08:45:25,818 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:25,819 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:25,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,958 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:25,958 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:25,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:25,970 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:25,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:45:25,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:45:26,241 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:45:26,244 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:26,244 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:26,244 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:26,244 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:26,244 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:45:26,244 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,244 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:26,244 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:26,244 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-25 08:45:26,244 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:26,245 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:26,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:26,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:26,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:26,367 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:26,371 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:26,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:26,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:26,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:26,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:26,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:26,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:26,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:26,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:26,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:26,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:26,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:26,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:26,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:26,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:45:26,469 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-25 08:45:26,470 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:26,489 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:45:26,489 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:45:26,489 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:45:26,490 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-11-25 08:45:26,495 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:26,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:45:26,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,620 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:45:26,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-25 08:45:26,677 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 111 states and 132 transitions. Complement of second has 6 states. [2019-11-25 08:45:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:45:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2019-11-25 08:45:26,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-25 08:45:26,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:26,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-25 08:45:26,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:26,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-25 08:45:26,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:26,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2019-11-25 08:45:26,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-11-25 08:45:26,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2019-11-25 08:45:26,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-25 08:45:26,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-11-25 08:45:26,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2019-11-25 08:45:26,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:26,704 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-11-25 08:45:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2019-11-25 08:45:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-11-25 08:45:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-25 08:45:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-25 08:45:26,711 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-25 08:45:26,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,712 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2019-11-25 08:45:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,747 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-11-25 08:45:26,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2019-11-25 08:45:26,750 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2019-11-25 08:45:26,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2019-11-25 08:45:26,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-25 08:45:26,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-25 08:45:26,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2019-11-25 08:45:26,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:26,753 INFO L688 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-11-25 08:45:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2019-11-25 08:45:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-11-25 08:45:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 08:45:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-25 08:45:26,764 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-25 08:45:26,764 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-25 08:45:26,764 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:45:26,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-25 08:45:26,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-11-25 08:45:26,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:26,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:26,765 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:45:26,766 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,766 INFO L794 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 699#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 665#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 666#L45-1 [2019-11-25 08:45:26,766 INFO L796 eck$LassoCheckResult]: Loop: 666#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 705#L24-2 assume !(main_~j~0 <= main_~r~0); 703#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 670#L4-30 assume !(0 == __VERIFIER_assert_~cond); 671#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 686#L4-33 assume !(0 == __VERIFIER_assert_~cond); 682#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 666#L45-1 [2019-11-25 08:45:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2019-11-25 08:45:26,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578675828] [2019-11-25 08:45:26,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:26,782 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:26,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2019-11-25 08:45:26,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568183879] [2019-11-25 08:45:26,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:26,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2019-11-25 08:45:26,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401541707] [2019-11-25 08:45:26,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401541707] [2019-11-25 08:45:26,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:45:26,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451810069] [2019-11-25 08:45:27,030 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:27,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:27,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:27,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:27,031 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:45:27,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:27,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:27,032 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:27,032 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-25 08:45:27,032 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:27,032 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:27,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:27,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:27,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:27,141 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:27,141 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:27,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:27,146 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:27,151 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:45:27,151 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:27,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:27,173 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:27,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:45:27,199 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:27,563 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:45:27,568 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:27,568 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:27,568 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:27,568 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:27,568 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:45:27,568 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:27,568 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:27,569 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:27,569 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-25 08:45:27,569 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:27,569 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:27,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:27,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:27,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:27,692 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:27,692 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:27,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:27,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:27,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:27,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:27,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:27,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:27,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:27,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:27,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:27,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:27,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:27,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:27,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:27,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:27,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:27,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:27,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:27,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:45:27,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-25 08:45:27,742 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:27,757 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:45:27,757 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:45:27,757 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:45:27,758 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-11-25 08:45:27,762 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:45:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:27,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:45:27,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:45:27,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-11-25 08:45:27,855 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 155 states and 181 transitions. Complement of second has 6 states. [2019-11-25 08:45:27,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:45:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2019-11-25 08:45:27,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-25 08:45:27,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:27,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-25 08:45:27,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:27,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-25 08:45:27,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:27,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2019-11-25 08:45:27,858 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2019-11-25 08:45:27,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2019-11-25 08:45:27,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-25 08:45:27,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-11-25 08:45:27,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2019-11-25 08:45:27,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:27,860 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-25 08:45:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2019-11-25 08:45:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2019-11-25 08:45:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-25 08:45:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-11-25 08:45:27,865 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-11-25 08:45:27,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:45:27,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:27,865 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-11-25 08:45:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,031 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-11-25 08:45:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:45:28,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2019-11-25 08:45:28,035 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-11-25 08:45:28,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2019-11-25 08:45:28,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-11-25 08:45:28,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-11-25 08:45:28,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2019-11-25 08:45:28,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:28,038 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-11-25 08:45:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2019-11-25 08:45:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2019-11-25 08:45:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 08:45:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-25 08:45:28,055 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-25 08:45:28,055 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-25 08:45:28,055 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:45:28,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-25 08:45:28,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-25 08:45:28,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:28,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:28,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:45:28,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,058 INFO L794 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1260#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1203#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1205#L45-1 [2019-11-25 08:45:28,058 INFO L796 eck$LassoCheckResult]: Loop: 1205#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1232#L24-2 assume !!(main_~j~0 <= main_~r~0); 1239#L25 assume !(main_~j~0 < main_~r~0); 1236#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1234#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1228#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1222#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1223#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1253#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1226#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1227#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1252#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1249#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1205#L45-1 [2019-11-25 08:45:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,058 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2019-11-25 08:45:28,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066563077] [2019-11-25 08:45:28,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:28,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2019-11-25 08:45:28,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891647822] [2019-11-25 08:45:28,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:28,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2019-11-25 08:45:28,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659151484] [2019-11-25 08:45:28,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659151484] [2019-11-25 08:45:28,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:28,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770507984] [2019-11-25 08:45:28,399 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-11-25 08:45:28,400 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:28,401 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:28,401 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:28,401 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:28,401 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:45:28,401 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:28,401 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:28,401 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:28,401 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-25 08:45:28,401 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:28,402 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:28,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:28,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:28,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:28,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:28,507 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:28,508 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:28,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:28,514 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:28,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:45:28,534 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:45:28,550 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:45:28,552 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:28,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:28,553 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:28,553 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:28,553 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:45:28,553 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:28,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:28,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:28,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-25 08:45:28,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:28,553 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:28,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:28,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:28,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:28,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:28,675 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:28,675 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:28,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:28,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:28,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:28,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:28,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:28,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:28,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:28,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:28,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:45:28,692 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-25 08:45:28,692 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:28,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:45:28,697 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:45:28,697 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:45:28,697 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-25 08:45:28,699 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:45:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:28,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:45:28,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,740 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:45:28,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-25 08:45:28,784 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 124 states and 144 transitions. Complement of second has 4 states. [2019-11-25 08:45:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:45:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2019-11-25 08:45:28,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2019-11-25 08:45:28,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:28,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2019-11-25 08:45:28,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:28,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2019-11-25 08:45:28,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:28,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-11-25 08:45:28,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-11-25 08:45:28,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2019-11-25 08:45:28,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-25 08:45:28,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-25 08:45:28,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2019-11-25 08:45:28,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:28,790 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-11-25 08:45:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2019-11-25 08:45:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-11-25 08:45:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-25 08:45:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-11-25 08:45:28,801 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-11-25 08:45:28,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:28,802 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 4 states. [2019-11-25 08:45:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,846 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-25 08:45:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:28,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 75 transitions. [2019-11-25 08:45:28,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-25 08:45:28,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 74 transitions. [2019-11-25 08:45:28,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-25 08:45:28,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-25 08:45:28,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2019-11-25 08:45:28,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:28,849 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-25 08:45:28,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2019-11-25 08:45:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-25 08:45:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 08:45:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-25 08:45:28,851 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-25 08:45:28,852 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-25 08:45:28,852 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:45:28,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2019-11-25 08:45:28,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-25 08:45:28,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:28,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:28,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:45:28,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,853 INFO L794 eck$LassoCheckResult]: Stem: 1702#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1703#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1646#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1647#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1675#L24-2 [2019-11-25 08:45:28,853 INFO L796 eck$LassoCheckResult]: Loop: 1675#L24-2 assume !!(main_~j~0 <= main_~r~0); 1682#L25 assume !(main_~j~0 < main_~r~0); 1677#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1678#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1670#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1664#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1665#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1696#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1668#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1669#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1695#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1692#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1674#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1675#L24-2 [2019-11-25 08:45:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2019-11-25 08:45:28,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598261791] [2019-11-25 08:45:28,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2019-11-25 08:45:28,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730619298] [2019-11-25 08:45:28,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,885 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2019-11-25 08:45:28,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109637882] [2019-11-25 08:45:28,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109637882] [2019-11-25 08:45:28,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:45:28,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120935020] [2019-11-25 08:45:29,167 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-11-25 08:45:29,168 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:29,168 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:29,168 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:29,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:29,169 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:45:29,169 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,169 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:29,169 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:29,169 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-25 08:45:29,169 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:29,169 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:29,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:29,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:29,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:29,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:29,284 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:29,284 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:29,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:29,301 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,306 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:45:29,306 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=7} Honda state: {ULTIMATE.start_main_#t~nondet5=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/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 [2019-11-25 08:45:29,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:29,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:45:29,325 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:45:29,325 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:29,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:29,338 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:29,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:45:29,363 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,785 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:45:29,788 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:29,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:29,788 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:29,789 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:29,789 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:45:29,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:29,789 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:29,789 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-25 08:45:29,789 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:29,789 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:29,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:29,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:29,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:29,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:29,895 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:29,896 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:29,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:29,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:29,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:29,902 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-25 08:45:29,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:29,902 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-25 08:45:29,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:29,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:29,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:29,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:29,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:29,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:29,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:29,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:29,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:29,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:29,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:29,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:29,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:29,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:29,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:29,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:29,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:29,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:29,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:29,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:29,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:29,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:29,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:29,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:29,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:29,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:45:29,955 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-25 08:45:29,955 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:29,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:45:29,982 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:45:29,982 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:45:29,982 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-25 08:45:29,984 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:45:29,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:30,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:45:30,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:30,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:45:30,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-25 08:45:30,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 128 states and 150 transitions. Complement of second has 6 states. [2019-11-25 08:45:30,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:45:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-11-25 08:45:30,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2019-11-25 08:45:30,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:30,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2019-11-25 08:45:30,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:30,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2019-11-25 08:45:30,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:30,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2019-11-25 08:45:30,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-25 08:45:30,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2019-11-25 08:45:30,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-25 08:45:30,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-25 08:45:30,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2019-11-25 08:45:30,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:30,087 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-11-25 08:45:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2019-11-25 08:45:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-25 08:45:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-25 08:45:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-11-25 08:45:30,092 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-25 08:45:30,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:45:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:45:30,096 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2019-11-25 08:45:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,296 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2019-11-25 08:45:30,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:45:30,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2019-11-25 08:45:30,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-25 08:45:30,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2019-11-25 08:45:30,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-25 08:45:30,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-11-25 08:45:30,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2019-11-25 08:45:30,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:30,303 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2019-11-25 08:45:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2019-11-25 08:45:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2019-11-25 08:45:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-25 08:45:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-11-25 08:45:30,309 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-25 08:45:30,309 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-25 08:45:30,309 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:45:30,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2019-11-25 08:45:30,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-25 08:45:30,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:30,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:30,311 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:45:30,311 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,311 INFO L794 eck$LassoCheckResult]: Stem: 2504#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2505#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2447#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2448#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2475#L24-2 assume !!(main_~j~0 <= main_~r~0); 2483#L25 [2019-11-25 08:45:30,311 INFO L796 eck$LassoCheckResult]: Loop: 2483#L25 assume !(main_~j~0 < main_~r~0); 2478#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2479#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2471#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2465#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2466#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2495#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2491#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2487#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2488#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2508#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2502#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2463#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2457#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2458#L24-2 assume !!(main_~j~0 <= main_~r~0); 2483#L25 [2019-11-25 08:45:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2019-11-25 08:45:30,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244799217] [2019-11-25 08:45:30,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:30,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2019-11-25 08:45:30,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089066959] [2019-11-25 08:45:30,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:30,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089066959] [2019-11-25 08:45:30,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:30,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646632548] [2019-11-25 08:45:30,446 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:45:30,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:45:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:45:30,446 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-11-25 08:45:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,649 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2019-11-25 08:45:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:45:30,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 254 transitions. [2019-11-25 08:45:30,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-25 08:45:30,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 240 transitions. [2019-11-25 08:45:30,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-25 08:45:30,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-25 08:45:30,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 240 transitions. [2019-11-25 08:45:30,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:30,654 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 240 transitions. [2019-11-25 08:45:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 240 transitions. [2019-11-25 08:45:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 163. [2019-11-25 08:45:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:45:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2019-11-25 08:45:30,659 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-25 08:45:30,659 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-25 08:45:30,659 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:45:30,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2019-11-25 08:45:30,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-25 08:45:30,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:30,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:30,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:45:30,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,661 INFO L794 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2871#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2811#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2812#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2839#L24-2 assume !!(main_~j~0 <= main_~r~0); 2848#L25 [2019-11-25 08:45:30,661 INFO L796 eck$LassoCheckResult]: Loop: 2848#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2849#L4 assume !(0 == __VERIFIER_assert_~cond); 2879#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2875#L4-3 assume !(0 == __VERIFIER_assert_~cond); 2866#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2825#L4-6 assume !(0 == __VERIFIER_assert_~cond); 2819#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2813#L4-9 assume !(0 == __VERIFIER_assert_~cond); 2814#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 2842#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2843#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2835#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2829#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2830#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2861#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2857#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2853#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2854#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2877#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2868#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2827#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2821#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2822#L24-2 assume !!(main_~j~0 <= main_~r~0); 2848#L25 [2019-11-25 08:45:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2019-11-25 08:45:30,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061678234] [2019-11-25 08:45:30,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:30,671 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2019-11-25 08:45:30,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236697154] [2019-11-25 08:45:30,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:30,695 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2019-11-25 08:45:30,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060233071] [2019-11-25 08:45:30,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:30,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060233071] [2019-11-25 08:45:30,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903248073] [2019-11-25 08:45:30,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:45:30,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:30,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:30,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:31,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:45:31,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-25 08:45:31,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275251158] [2019-11-25 08:45:31,246 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-25 08:45:31,248 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-25 08:45:32,044 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-11-25 08:45:32,045 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:32,045 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:32,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:32,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:32,046 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:45:32,046 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:32,046 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:32,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:32,046 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-25 08:45:32,046 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:32,046 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:32,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:32,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:32,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:32,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:32,159 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:32,159 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:32,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:32,164 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:32,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:45:32,176 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:32,318 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:45:32,320 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:32,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:32,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:32,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:32,320 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:45:32,321 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:32,321 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:32,321 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:32,321 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-25 08:45:32,321 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:32,321 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:32,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:32,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:32,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:32,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:32,426 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:32,426 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:32,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:32,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:32,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:32,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:32,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:32,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:32,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:32,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:32,437 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:45:32,442 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-25 08:45:32,442 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:32,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:45:32,446 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:45:32,446 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:45:32,446 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~n~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:32,453 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:45:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:32,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:45:32,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:32,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:32,617 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-25 08:45:32,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-25 08:45:32,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 638 states and 696 transitions. Complement of second has 17 states. [2019-11-25 08:45:32,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:45:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2019-11-25 08:45:32,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 78 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-25 08:45:32,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:32,911 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:45:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:32,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:45:32,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:32,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:33,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:33,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-25 08:45:33,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-25 08:45:33,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 724 states and 790 transitions. Complement of second has 27 states. [2019-11-25 08:45:33,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:45:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2019-11-25 08:45:33,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-25 08:45:33,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:33,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 28 letters. Loop has 23 letters. [2019-11-25 08:45:33,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:33,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 46 letters. [2019-11-25 08:45:33,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:33,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 790 transitions. [2019-11-25 08:45:33,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-25 08:45:33,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 581 states and 644 transitions. [2019-11-25 08:45:33,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-25 08:45:33,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-25 08:45:33,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 644 transitions. [2019-11-25 08:45:33,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:33,641 INFO L688 BuchiCegarLoop]: Abstraction has 581 states and 644 transitions. [2019-11-25 08:45:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 644 transitions. [2019-11-25 08:45:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 409. [2019-11-25 08:45:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-25 08:45:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2019-11-25 08:45:33,651 INFO L711 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2019-11-25 08:45:33,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:45:33,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:45:33,652 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 7 states. [2019-11-25 08:45:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,083 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2019-11-25 08:45:34,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:45:34,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2019-11-25 08:45:34,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-25 08:45:34,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2019-11-25 08:45:34,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-25 08:45:34,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-25 08:45:34,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2019-11-25 08:45:34,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:34,092 INFO L688 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2019-11-25 08:45:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2019-11-25 08:45:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2019-11-25 08:45:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-25 08:45:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2019-11-25 08:45:34,097 INFO L711 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-25 08:45:34,098 INFO L591 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-25 08:45:34,098 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:45:34,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2019-11-25 08:45:34,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-25 08:45:34,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:34,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:34,100 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,101 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,101 INFO L794 eck$LassoCheckResult]: Stem: 5774#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 5775#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 5713#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 5714#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5743#L24-2 assume !!(main_~j~0 <= main_~r~0); 5859#L25 assume !(main_~j~0 < main_~r~0); 5858#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5917#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5916#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5734#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5735#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 5768#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5719#L4-30 assume !(0 == __VERIFIER_assert_~cond); 5720#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5750#L4-33 assume !(0 == __VERIFIER_assert_~cond); 5751#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 5790#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5724#L24-2 [2019-11-25 08:45:34,101 INFO L796 eck$LassoCheckResult]: Loop: 5724#L24-2 assume !!(main_~j~0 <= main_~r~0); 5752#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5753#L4 assume !(0 == __VERIFIER_assert_~cond); 5784#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5778#L4-3 assume !(0 == __VERIFIER_assert_~cond); 5769#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5727#L4-6 assume !(0 == __VERIFIER_assert_~cond); 5721#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5715#L4-9 assume !(0 == __VERIFIER_assert_~cond); 5716#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 5746#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5747#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5738#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5732#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5733#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5765#L4-18 assume !(0 == __VERIFIER_assert_~cond); 5761#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5757#L4-21 assume !(0 == __VERIFIER_assert_~cond); 5758#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5781#L4-24 assume !(0 == __VERIFIER_assert_~cond); 5772#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5730#L4-27 assume !(0 == __VERIFIER_assert_~cond); 5723#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5724#L24-2 [2019-11-25 08:45:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2019-11-25 08:45:34,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293498459] [2019-11-25 08:45:34,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:34,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2019-11-25 08:45:34,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969961753] [2019-11-25 08:45:34,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:34,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:34,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2019-11-25 08:45:34,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802557480] [2019-11-25 08:45:34,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:34,170 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:34,386 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-25 08:45:34,387 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-25 08:45:34,990 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-11-25 08:45:34,992 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:34,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:34,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:34,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:34,992 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:45:34,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:34,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:34,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:34,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-25 08:45:34,992 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:34,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:34,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:35,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:35,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:35,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:35,099 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:35,100 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:35,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:35,103 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:35,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:45:35,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:45:35,219 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:45:35,220 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:35,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:35,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:35,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:35,220 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:45:35,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:35,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:35,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:35,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-25 08:45:35,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:35,221 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:35,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:35,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:35,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:35,301 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:35,301 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:35,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:35,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:35,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:35,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:35,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:35,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:35,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:35,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:35,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:45:35,314 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-25 08:45:35,314 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:35,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:45:35,317 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:45:35,317 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:45:35,317 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-25 08:45:35,318 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:45:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:35,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-11-25 08:45:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:45:35,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:35,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:35,449 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-25 08:45:35,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-25 08:45:35,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 384 states and 424 transitions. Complement of second has 17 states. [2019-11-25 08:45:35,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:45:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2019-11-25 08:45:35,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 61 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-25 08:45:35,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:35,716 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:45:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:35,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:45:35,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:35,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-25 08:45:35,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-25 08:45:36,228 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 460 states and 504 transitions. Complement of second has 25 states. [2019-11-25 08:45:36,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:45:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2019-11-25 08:45:36,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 80 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-25 08:45:36,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:36,229 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:45:36,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:36,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:45:36,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:36,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:36,340 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-25 08:45:36,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-25 08:45:36,598 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 804 states and 878 transitions. Complement of second has 16 states. [2019-11-25 08:45:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:45:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2019-11-25 08:45:36,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 114 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-25 08:45:36,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:36,600 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:45:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:36,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:45:36,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:36,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:36,740 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-25 08:45:36,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-25 08:45:37,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 777 states and 851 transitions. Complement of second has 24 states. [2019-11-25 08:45:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:45:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2019-11-25 08:45:37,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-25 08:45:37,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:37,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 40 letters. Loop has 23 letters. [2019-11-25 08:45:37,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:37,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 17 letters. Loop has 46 letters. [2019-11-25 08:45:37,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:37,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 851 transitions. [2019-11-25 08:45:37,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-25 08:45:37,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 546 states and 604 transitions. [2019-11-25 08:45:37,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-25 08:45:37,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-25 08:45:37,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 604 transitions. [2019-11-25 08:45:37,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:45:37,173 INFO L688 BuchiCegarLoop]: Abstraction has 546 states and 604 transitions. [2019-11-25 08:45:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 604 transitions. [2019-11-25 08:45:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 403. [2019-11-25 08:45:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-25 08:45:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 449 transitions. [2019-11-25 08:45:37,181 INFO L711 BuchiCegarLoop]: Abstraction has 403 states and 449 transitions. [2019-11-25 08:45:37,181 INFO L591 BuchiCegarLoop]: Abstraction has 403 states and 449 transitions. [2019-11-25 08:45:37,181 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:45:37,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 449 transitions. [2019-11-25 08:45:37,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-25 08:45:37,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:37,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:37,184 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:37,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:37,185 INFO L794 eck$LassoCheckResult]: Stem: 9056#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 9057#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 8991#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 8992#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 9021#L24-2 assume !!(main_~j~0 <= main_~r~0); 9253#L25 assume !(main_~j~0 < main_~r~0); 9035#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9393#L4-12 assume !(0 == __VERIFIER_assert_~cond); 9392#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9391#L4-15 assume !(0 == __VERIFIER_assert_~cond); 9390#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 9054#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9055#L4-30 assume !(0 == __VERIFIER_assert_~cond); 9036#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9029#L4-33 assume !(0 == __VERIFIER_assert_~cond); 9019#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 9020#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 9022#L24-2 assume !!(main_~j~0 <= main_~r~0); 9073#L25 [2019-11-25 08:45:37,185 INFO L796 eck$LassoCheckResult]: Loop: 9073#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9070#L4 assume !(0 == __VERIFIER_assert_~cond); 9068#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9062#L4-3 assume !(0 == __VERIFIER_assert_~cond); 9048#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9005#L4-6 assume !(0 == __VERIFIER_assert_~cond); 8999#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8993#L4-9 assume !(0 == __VERIFIER_assert_~cond); 8994#L4-11 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; 9024#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9025#L4-12 assume !(0 == __VERIFIER_assert_~cond); 9017#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9011#L4-15 assume !(0 == __VERIFIER_assert_~cond); 9012#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9045#L4-18 assume !(0 == __VERIFIER_assert_~cond); 9041#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9037#L4-21 assume !(0 == __VERIFIER_assert_~cond); 9038#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9065#L4-24 assume !(0 == __VERIFIER_assert_~cond); 9051#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 9008#L4-27 assume !(0 == __VERIFIER_assert_~cond); 9001#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 9002#L24-2 assume !!(main_~j~0 <= main_~r~0); 9073#L25 [2019-11-25 08:45:37,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,185 INFO L82 PathProgramCache]: Analyzing trace with hash -430226800, now seen corresponding path program 2 times [2019-11-25 08:45:37,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:37,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115002810] [2019-11-25 08:45:37,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:37,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:37,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 992185381, now seen corresponding path program 1 times [2019-11-25 08:45:37,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:37,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356405209] [2019-11-25 08:45:37,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:37,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:37,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1977821002, now seen corresponding path program 1 times [2019-11-25 08:45:37,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:37,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117919032] [2019-11-25 08:45:37,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:37,286 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:37,497 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-11-25 08:45:37,498 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-25 08:45:37,857 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:37,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:37,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:37,857 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:37,857 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:45:37,857 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:37,857 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:37,857 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:37,857 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2019-11-25 08:45:37,858 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:37,858 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:37,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:37,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:37,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:37,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:37,957 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:37,958 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:37,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:37,966 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:37,970 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:45:37,970 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:37,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:37,978 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:37,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:45:37,982 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:37,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:45:37,988 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:38,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:45:38,002 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:38,089 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:45:38,091 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:38,091 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:38,091 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:38,091 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:38,091 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:45:38,091 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:38,091 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:38,091 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:38,091 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2019-11-25 08:45:38,092 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:38,092 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:38,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:38,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:38,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:38,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:38,193 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:38,193 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:38,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:38,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:38,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:38,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:38,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:38,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:38,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:38,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:38,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:38,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:45:38,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:38,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:38,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:38,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:38,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:38,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:38,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:38,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:45:38,214 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-25 08:45:38,214 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b823861-7cf2-42d8-96ee-d7995e5c634c/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:38,217 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:45:38,217 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:45:38,217 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:45:38,217 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~r~0) = -4*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-25 08:45:38,218 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:45:38,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:38,303 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-25 08:45:38,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-25 08:45:38,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 617 states and 677 transitions. Complement of second has 13 states. [2019-11-25 08:45:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:45:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2019-11-25 08:45:38,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-25 08:45:38,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:38,467 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:45:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:38,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-25 08:45:38,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-25 08:45:38,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 617 states and 677 transitions. Complement of second has 13 states. [2019-11-25 08:45:38,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:45:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2019-11-25 08:45:38,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-25 08:45:38,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:38,754 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:45:38,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:38,851 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-25 08:45:38,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-25 08:45:39,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 897 states and 970 transitions. Complement of second has 12 states. [2019-11-25 08:45:39,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-25 08:45:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:45:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2019-11-25 08:45:39,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-25 08:45:39,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:39,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 41 letters. Loop has 23 letters. [2019-11-25 08:45:39,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:39,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 18 letters. Loop has 46 letters. [2019-11-25 08:45:39,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:39,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 897 states and 970 transitions. [2019-11-25 08:45:39,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:45:39,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 897 states to 0 states and 0 transitions. [2019-11-25 08:45:39,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-25 08:45:39,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-25 08:45:39,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-25 08:45:39,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:39,164 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:45:39,164 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:45:39,164 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:45:39,164 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:45:39,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:45:39,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:45:39,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-25 08:45:39,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:45:39 BoogieIcfgContainer [2019-11-25 08:45:39,171 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:45:39,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:45:39,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:45:39,172 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:45:39,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/4) ... [2019-11-25 08:45:39,176 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:45:39,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:45:39,180 INFO L168 Benchmark]: Toolchain (without parser) took 14859.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.8 MB). Free memory was 948.7 MB in the beginning and 991.3 MB in the end (delta: -42.6 MB). Peak memory consumption was 233.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,181 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:39,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,184 INFO L168 Benchmark]: Boogie Preprocessor took 24.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,184 INFO L168 Benchmark]: RCFGBuilder took 389.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,185 INFO L168 Benchmark]: BuchiAutomizer took 14120.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 991.3 MB in the end (delta: 110.8 MB). Peak memory consumption was 255.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,186 INFO L168 Benchmark]: Witness Printer took 4.36 ms. Allocated memory is still 1.3 GB. Free memory is still 991.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:39,187 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14120.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 991.3 MB in the end (delta: 110.8 MB). Peak memory consumption was 255.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.36 ms. Allocated memory is still 1.3 GB. Free memory is still 991.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (8 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 3 * n and consists of 14 locations. One nondeterministic module has affine ranking function 3 * n + -2 * j and consists of 13 locations. One nondeterministic module has affine ranking function -4 * j + 3 * r and consists of 7 locations. 8 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.0s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 8.0s. Construction of modules took 2.2s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 943 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 403 states and ocurred in iteration 9. Nontrivial modules had stage [4, 1, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 988 SDtfs, 1744 SDslu, 1216 SDs, 0 SdLazy, 2038 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT2 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital37 mio100 ax100 hnf97 lsp73 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp98 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...