./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:04:40,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:04:40,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:04:40,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:04:40,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:04:40,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:04:40,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:04:40,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:04:40,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:04:40,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:04:40,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:04:40,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:04:40,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:04:40,599 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:04:40,600 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:04:40,600 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:04:40,600 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:04:40,600 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:04:40,601 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:04:40,601 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:04:40,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:04:40,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:04:40,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:04:40,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:04:40,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:04:40,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:04:40,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:04:40,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:04:40,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:04:40,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:04:40,603 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:04:40,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:04:40,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:04:40,604 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:04:40,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:04:40,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:04:40,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:04:40,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:04:40,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:04:40,608 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:04:40,608 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2024-11-10 23:04:40,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:04:40,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:04:40,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:04:40,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:04:40,893 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:04:40,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2024-11-10 23:04:42,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:04:42,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:04:42,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-11-10 23:04:42,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b280fad/3d27c3a0824643bc864206c50002552c/FLAGd43d13f10 [2024-11-10 23:04:42,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b280fad/3d27c3a0824643bc864206c50002552c [2024-11-10 23:04:42,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:04:42,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:04:42,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:04:42,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:04:42,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:04:42,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:04:42" (1/1) ... [2024-11-10 23:04:42,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b45201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:42, skipping insertion in model container [2024-11-10 23:04:42,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:04:42" (1/1) ... [2024-11-10 23:04:42,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:04:43,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:04:43,181 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:04:43,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:04:43,216 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:04:43,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43 WrapperNode [2024-11-10 23:04:43,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:04:43,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:04:43,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:04:43,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:04:43,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,264 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 17, calls inlined = 30, statements flattened = 185 [2024-11-10 23:04:43,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:04:43,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:04:43,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:04:43,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:04:43,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,289 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 23:04:43,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:04:43,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:04:43,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:04:43,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:04:43,302 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (1/1) ... [2024-11-10 23:04:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:43,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:43,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:43,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 23:04:43,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:04:43,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:04:43,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:04:43,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:04:43,446 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:04:43,448 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:04:43,685 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-10 23:04:43,685 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:04:43,704 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:04:43,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:04:43,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:43 BoogieIcfgContainer [2024-11-10 23:04:43,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:04:43,706 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:04:43,706 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:04:43,709 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:04:43,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:43,710 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:04:42" (1/3) ... [2024-11-10 23:04:43,711 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@115c8289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:04:43, skipping insertion in model container [2024-11-10 23:04:43,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:43,711 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:43" (2/3) ... [2024-11-10 23:04:43,711 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@115c8289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:04:43, skipping insertion in model container [2024-11-10 23:04:43,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:43,712 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:43" (3/3) ... [2024-11-10 23:04:43,713 INFO L332 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2024-11-10 23:04:43,764 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:04:43,764 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:04:43,764 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:04:43,764 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:04:43,764 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:04:43,765 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:04:43,765 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:04:43,765 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:04:43,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:43,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2024-11-10 23:04:43,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:43,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:43,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:04:43,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:43,800 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:04:43,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:43,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2024-11-10 23:04:43,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:43,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:43,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:04:43,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:43,819 INFO L745 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 30#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 85#L27-1true assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 3#L30true assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 64#L35true [2024-11-10 23:04:43,820 INFO L747 eck$LassoCheckResult]: Loop: 64#L35true assume true; 52#L35-1true assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 81#L38true assume !true; 46#L59true assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68#L18-1true assume !(0 == __VERIFIER_assert_~cond#1); 62#L21-1true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29#L18true assume !(0 == __VERIFIER_assert_~cond#1); 32#L21true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 64#L35true [2024-11-10 23:04:43,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash 5355387, now seen corresponding path program 1 times [2024-11-10 23:04:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642011451] [2024-11-10 23:04:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:43,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:44,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:44,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1291056228, now seen corresponding path program 1 times [2024-11-10 23:04:44,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762340707] [2024-11-10 23:04:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:44,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:44,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762340707] [2024-11-10 23:04:44,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762340707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:44,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 23:04:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541736310] [2024-11-10 23:04:44,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:44,063 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:04:44,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 23:04:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 23:04:44,090 INFO L87 Difference]: Start difference. First operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:44,099 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-10 23:04:44,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 80 transitions. [2024-11-10 23:04:44,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2024-11-10 23:04:44,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2024-11-10 23:04:44,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-11-10 23:04:44,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-10 23:04:44,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2024-11-10 23:04:44,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:04:44,110 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-10 23:04:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2024-11-10 23:04:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 23:04:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-10 23:04:44,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-10 23:04:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 23:04:44,137 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-10 23:04:44,138 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:04:44,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2024-11-10 23:04:44,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2024-11-10 23:04:44,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:44,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:44,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:04:44,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:44,140 INFO L745 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 203#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 208#L27-1 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 168#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 169#L35 [2024-11-10 23:04:44,140 INFO L747 eck$LassoCheckResult]: Loop: 169#L35 assume true; 183#L35-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 184#L38 assume true; 204#L38-1 assume !(main_~j~0#1 <= main_~r~0#1); 175#L59 assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 176#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 197#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 198#L18 assume !(0 == __VERIFIER_assert_~cond#1); 206#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 169#L35 [2024-11-10 23:04:44,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash 5355387, now seen corresponding path program 2 times [2024-11-10 23:04:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824078847] [2024-11-10 23:04:44,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:44,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:44,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:44,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -749981177, now seen corresponding path program 1 times [2024-11-10 23:04:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241452443] [2024-11-10 23:04:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:44,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:44,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:44,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1996995635, now seen corresponding path program 1 times [2024-11-10 23:04:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042596708] [2024-11-10 23:04:44,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:44,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:44,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042596708] [2024-11-10 23:04:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042596708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:44,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:44,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:04:44,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74550145] [2024-11-10 23:04:44,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:44,431 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:44,431 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:44,431 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:44,431 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:44,431 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:04:44,432 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:44,432 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:44,432 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:44,432 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2024-11-10 23:04:44,432 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:44,432 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:44,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,538 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:44,539 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:04:44,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:44,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:44,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:44,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 23:04:44,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:44,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:44,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-10 23:04:44,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:44,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:44,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 23:04:44,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:04:44,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:44,712 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:04:44,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:44,718 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:44,718 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:44,718 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:44,718 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:44,718 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:04:44,718 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:44,719 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:44,719 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:44,719 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2024-11-10 23:04:44,719 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:44,719 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:44,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:44,787 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:44,791 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:04:44,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:44,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:44,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 23:04:44,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:44,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:44,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:44,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:44,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:44,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:44,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:44,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:44,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:44,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:44,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:44,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:44,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 23:04:44,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:44,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:44,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:44,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:44,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:44,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:44,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:44,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:44,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:44,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:44,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:44,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:44,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:44,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 23:04:44,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:44,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:44,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:44,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:44,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:44,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:44,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:44,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:44,892 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:04:44,899 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:04:44,899 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 23:04:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:44,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 23:04:44,923 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:04:44,923 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:04:44,923 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:04:44,924 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2024-11-10 23:04:44,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 23:04:44,938 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:04:44,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:44,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:04:44,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:45,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:04:45,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:45,052 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:04:45,053 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:45,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 118 states and 135 transitions. Complement of second has 6 states. [2024-11-10 23:04:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:04:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-10 23:04:45,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 9 letters. [2024-11-10 23:04:45,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:45,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 13 letters. Loop has 9 letters. [2024-11-10 23:04:45,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:45,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 18 letters. [2024-11-10 23:04:45,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:45,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 135 transitions. [2024-11-10 23:04:45,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2024-11-10 23:04:45,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 114 states and 131 transitions. [2024-11-10 23:04:45,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2024-11-10 23:04:45,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-10 23:04:45,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 131 transitions. [2024-11-10 23:04:45,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:04:45,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-11-10 23:04:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 131 transitions. [2024-11-10 23:04:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-10 23:04:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.1504424778761062) internal successors, (130), 112 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2024-11-10 23:04:45,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 130 transitions. [2024-11-10 23:04:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:04:45,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:04:45,141 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:45,159 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2024-11-10 23:04:45,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 156 transitions. [2024-11-10 23:04:45,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2024-11-10 23:04:45,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 104 states and 118 transitions. [2024-11-10 23:04:45,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-11-10 23:04:45,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-11-10 23:04:45,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 118 transitions. [2024-11-10 23:04:45,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:04:45,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-11-10 23:04:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 118 transitions. [2024-11-10 23:04:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 70. [2024-11-10 23:04:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-11-10 23:04:45,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-11-10 23:04:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:04:45,173 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-11-10 23:04:45,174 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:04:45,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 80 transitions. [2024-11-10 23:04:45,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2024-11-10 23:04:45,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:45,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:45,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:04:45,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:45,176 INFO L745 eck$LassoCheckResult]: Stem: 675#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 676#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 680#L27-1 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 641#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 642#L35 [2024-11-10 23:04:45,176 INFO L747 eck$LassoCheckResult]: Loop: 642#L35 assume true; 689#L35-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 687#L38 assume true; 684#L38-1 assume !(main_~j~0#1 <= main_~r~0#1); 681#L59 assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 674#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 668#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 669#L18 assume !(0 == __VERIFIER_assert_~cond#1); 678#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 642#L35 [2024-11-10 23:04:45,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 5355386, now seen corresponding path program 1 times [2024-11-10 23:04:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:45,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6192307] [2024-11-10 23:04:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:45,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:45,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:45,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash -749981177, now seen corresponding path program 2 times [2024-11-10 23:04:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:45,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084063739] [2024-11-10 23:04:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:45,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:45,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:45,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:45,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1800482130, now seen corresponding path program 1 times [2024-11-10 23:04:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:45,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243890951] [2024-11-10 23:04:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:45,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 23:04:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:45,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:45,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243890951] [2024-11-10 23:04:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243890951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:45,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 23:04:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740997112] [2024-11-10 23:04:45,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:45,571 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:45,572 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:45,572 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:45,572 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:45,572 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:04:45,572 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:45,572 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:45,572 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:45,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2024-11-10 23:04:45,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:45,573 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:45,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:45,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:45,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:45,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:45,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:45,639 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:45,639 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:04:45,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:45,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:45,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:45,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 23:04:45,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:45,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:45,665 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:45,665 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:45,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 23:04:45,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:45,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:45,706 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:45,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 23:04:45,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:45,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:45,727 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:45,727 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:45,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-10 23:04:45,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:45,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:45,745 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:45,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 23:04:45,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:45,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:45,765 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:45,766 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:45,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 23:04:45,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:45,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:45,784 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:45,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 23:04:45,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:45,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:45,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:45,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:45,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:45,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:45,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 23:04:45,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:04:45,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:45,967 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:04:45,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:45,973 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:45,973 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:45,973 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:45,973 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:45,973 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:04:45,973 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:45,974 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:45,975 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:45,976 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2024-11-10 23:04:45,976 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:45,976 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:45,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:45,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:45,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:45,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:46,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:46,040 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:46,041 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:04:46,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:46,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:46,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:46,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 23:04:46,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:46,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:46,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:46,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:46,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:46,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:46,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:46,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:46,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:46,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 23:04:46,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:46,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:46,078 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:46,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 23:04:46,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:46,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:46,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:46,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:46,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:46,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:46,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:46,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:46,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:46,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-10 23:04:46,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:46,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:46,117 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:46,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 23:04:46,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:46,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:46,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:46,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:46,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:46,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:46,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:46,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:46,140 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:04:46,148 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:04:46,148 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 23:04:46,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:46,153 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:46,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 23:04:46,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:04:46,155 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:04:46,156 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:04:46,156 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2024-11-10 23:04:46,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 23:04:46,172 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:04:46,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:46,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:04:46,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:46,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:04:46,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:46,256 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:04:46,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 80 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:46,308 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 80 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 169 states and 193 transitions. Complement of second has 6 states. [2024-11-10 23:04:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:04:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-11-10 23:04:46,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 9 letters. [2024-11-10 23:04:46,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:46,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 13 letters. Loop has 9 letters. [2024-11-10 23:04:46,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:46,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 18 letters. [2024-11-10 23:04:46,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:46,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 193 transitions. [2024-11-10 23:04:46,313 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2024-11-10 23:04:46,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 132 states and 151 transitions. [2024-11-10 23:04:46,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2024-11-10 23:04:46,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2024-11-10 23:04:46,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 151 transitions. [2024-11-10 23:04:46,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:04:46,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132 states and 151 transitions. [2024-11-10 23:04:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 151 transitions. [2024-11-10 23:04:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 71. [2024-11-10 23:04:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 70 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2024-11-10 23:04:46,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 82 transitions. [2024-11-10 23:04:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 23:04:46,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 23:04:46,321 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:46,444 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2024-11-10 23:04:46,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 166 transitions. [2024-11-10 23:04:46,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2024-11-10 23:04:46,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 166 transitions. [2024-11-10 23:04:46,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2024-11-10 23:04:46,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2024-11-10 23:04:46,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 166 transitions. [2024-11-10 23:04:46,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:04:46,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 166 transitions. [2024-11-10 23:04:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 166 transitions. [2024-11-10 23:04:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 76. [2024-11-10 23:04:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.144736842105263) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-10 23:04:46,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-10 23:04:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 23:04:46,455 INFO L425 stractBuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-10 23:04:46,456 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:04:46,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 87 transitions. [2024-11-10 23:04:46,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-10 23:04:46,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:46,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:46,457 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:04:46,457 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:46,458 INFO L745 eck$LassoCheckResult]: Stem: 1227#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1228#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1234#L27-1 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1167#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 1169#L35 [2024-11-10 23:04:46,458 INFO L747 eck$LassoCheckResult]: Loop: 1169#L35 assume true; 1190#L35-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1191#L38 assume true; 1235#L38-1 assume !(main_~j~0#1 <= main_~r~0#1); 1170#L59 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1171#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1204#L21-3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1194#L18-2 assume !(0 == __VERIFIER_assert_~cond#1); 1195#L21-2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1169#L35 [2024-11-10 23:04:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash 5355387, now seen corresponding path program 3 times [2024-11-10 23:04:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186072889] [2024-11-10 23:04:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:46,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:46,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:46,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash -733757992, now seen corresponding path program 1 times [2024-11-10 23:04:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:46,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226645822] [2024-11-10 23:04:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:46,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:46,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:46,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226645822] [2024-11-10 23:04:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226645822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:46,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:46,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 23:04:46,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158399306] [2024-11-10 23:04:46,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:46,523 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:04:46,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:46,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 23:04:46,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 23:04:46,523 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:46,596 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2024-11-10 23:04:46,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 154 transitions. [2024-11-10 23:04:46,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-11-10 23:04:46,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 136 states and 153 transitions. [2024-11-10 23:04:46,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-10 23:04:46,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-11-10 23:04:46,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 153 transitions. [2024-11-10 23:04:46,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:04:46,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 136 states and 153 transitions. [2024-11-10 23:04:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 153 transitions. [2024-11-10 23:04:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2024-11-10 23:04:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 74 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2024-11-10 23:04:46,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 86 transitions. [2024-11-10 23:04:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 23:04:46,612 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2024-11-10 23:04:46,613 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 23:04:46,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 86 transitions. [2024-11-10 23:04:46,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-11-10 23:04:46,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:46,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:46,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:04:46,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:46,615 INFO L745 eck$LassoCheckResult]: Stem: 1448#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1449#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1455#L27-1 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1389#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 1391#L35 [2024-11-10 23:04:46,615 INFO L747 eck$LassoCheckResult]: Loop: 1391#L35 assume true; 1412#L35-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1413#L38 assume true; 1446#L38-1 assume !!(main_~j~0#1 <= main_~r~0#1); 1442#L39 assume !(main_~j~0#1 < main_~r~0#1); 1385#L47 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1386#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 1439#L21-9 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1406#L18-8 assume !(0 == __VERIFIER_assert_~cond#1); 1407#L21-8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 1426#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 1392#L59 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1393#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1430#L21-3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1416#L18-2 assume !(0 == __VERIFIER_assert_~cond#1); 1417#L21-2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1391#L35 [2024-11-10 23:04:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash 5355387, now seen corresponding path program 4 times [2024-11-10 23:04:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562430990] [2024-11-10 23:04:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:46,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:46,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:46,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1047466307, now seen corresponding path program 1 times [2024-11-10 23:04:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:46,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751697539] [2024-11-10 23:04:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:46,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:46,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:46,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash -561483209, now seen corresponding path program 1 times [2024-11-10 23:04:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011967708] [2024-11-10 23:04:46,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:46,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011967708] [2024-11-10 23:04:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011967708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:46,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 23:04:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967957858] [2024-11-10 23:04:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:46,918 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:46,918 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:46,918 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:46,918 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:46,918 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:04:46,918 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:46,918 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:46,918 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:46,918 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2024-11-10 23:04:46,919 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:46,919 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:46,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:46,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:46,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:46,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:46,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,004 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:47,006 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:04:47,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,009 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 23:04:47,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:47,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:47,026 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:47,027 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:47,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-10 23:04:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,044 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 23:04:47,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:47,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:47,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,076 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 23:04:47,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:04:47,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:47,114 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:04:47,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:47,118 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:47,118 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:47,118 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:47,118 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:47,118 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:04:47,119 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,119 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:47,119 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:47,119 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2024-11-10 23:04:47,119 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:47,119 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:47,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,220 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:47,220 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:04:47,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,224 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 23:04:47,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:47,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 23:04:47,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:47,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:47,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:47,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:47,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:47,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:47,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:47,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:47,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,254 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 23:04:47,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:47,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:47,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:47,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:47,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:47,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:47,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:47,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:47,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:47,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-10 23:04:47,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,284 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 23:04:47,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:47,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:47,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:47,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:47,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:47,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:47,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:47,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:47,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:47,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-10 23:04:47,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,316 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 23:04:47,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:47,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:47,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:47,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:47,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:47,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:47,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:47,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:47,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:47,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:47,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,350 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 23:04:47,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:47,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:47,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:47,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:47,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:47,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:47,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:47,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:47,367 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:04:47,370 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:04:47,370 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 23:04:47,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,371 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 23:04:47,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:04:47,372 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:04:47,372 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:04:47,372 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2024-11-10 23:04:47,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-10 23:04:47,384 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:04:47,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:47,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:04:47,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:47,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:04:47,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:47,515 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:04:47,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 86 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:47,546 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 86 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 145 states and 165 transitions. Complement of second has 6 states. [2024-11-10 23:04:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:04:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-11-10 23:04:47,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 4 letters. Loop has 16 letters. [2024-11-10 23:04:47,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:47,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 20 letters. Loop has 16 letters. [2024-11-10 23:04:47,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:47,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 4 letters. Loop has 32 letters. [2024-11-10 23:04:47,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:47,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 165 transitions. [2024-11-10 23:04:47,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2024-11-10 23:04:47,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 140 states and 159 transitions. [2024-11-10 23:04:47,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2024-11-10 23:04:47,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-11-10 23:04:47,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2024-11-10 23:04:47,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:04:47,552 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 159 transitions. [2024-11-10 23:04:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2024-11-10 23:04:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-11-10 23:04:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 137 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2024-11-10 23:04:47,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 157 transitions. [2024-11-10 23:04:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:47,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 23:04:47,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 23:04:47,558 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:47,596 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-11-10 23:04:47,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 88 transitions. [2024-11-10 23:04:47,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-11-10 23:04:47,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 85 transitions. [2024-11-10 23:04:47,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-10 23:04:47,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-10 23:04:47,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 85 transitions. [2024-11-10 23:04:47,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:04:47,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-10 23:04:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 85 transitions. [2024-11-10 23:04:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 23:04:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-10 23:04:47,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-10 23:04:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 23:04:47,606 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-10 23:04:47,606 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 23:04:47,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 85 transitions. [2024-11-10 23:04:47,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-11-10 23:04:47,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:47,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:47,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 23:04:47,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:47,607 INFO L745 eck$LassoCheckResult]: Stem: 1966#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1967#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1973#L27-1 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1905#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 1906#L35 assume true; 1931#L35-1 [2024-11-10 23:04:47,607 INFO L747 eck$LassoCheckResult]: Loop: 1931#L35-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1932#L38 assume true; 1968#L38-1 assume !!(main_~j~0#1 <= main_~r~0#1); 1960#L39 assume !(main_~j~0#1 < main_~r~0#1); 1907#L47 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1908#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 1964#L21-9 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1925#L18-8 assume !(0 == __VERIFIER_assert_~cond#1); 1926#L21-8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 1945#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 1911#L59 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1912#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1949#L21-3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1935#L18-2 assume !(0 == __VERIFIER_assert_~cond#1); 1936#L21-2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1956#L35 assume true; 1931#L35-1 [2024-11-10 23:04:47,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:47,608 INFO L85 PathProgramCache]: Analyzing trace with hash 166017100, now seen corresponding path program 1 times [2024-11-10 23:04:47,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:47,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613873211] [2024-11-10 23:04:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:47,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:47,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:47,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:47,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1011175227, now seen corresponding path program 2 times [2024-11-10 23:04:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:47,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416333949] [2024-11-10 23:04:47,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:47,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:47,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:47,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash 770962192, now seen corresponding path program 1 times [2024-11-10 23:04:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:47,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853430666] [2024-11-10 23:04:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:47,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:47,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:47,782 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:47,782 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:47,783 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:47,783 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:47,783 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:04:47,783 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,783 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:47,783 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:47,783 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2024-11-10 23:04:47,783 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:47,783 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:47,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:47,851 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:47,852 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:04:47,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,854 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 23:04:47,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:47,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:47,874 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:47,875 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:47,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:47,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,890 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 23:04:47,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:47,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:47,902 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:47,902 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:47,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-10 23:04:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,914 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-10 23:04:47,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:47,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:47,926 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:47,926 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:47,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:47,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,938 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-10 23:04:47,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:47,940 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:47,951 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:47,951 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:47,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-10 23:04:47,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:47,963 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:47,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-10 23:04:47,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:47,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:47,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,000 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-10 23:04:48,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:04:48,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:48,045 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:04:48,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:48,050 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:48,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:48,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:48,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:48,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:04:48,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:48,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:48,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2024-11-10 23:04:48,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:48,051 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:48,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,130 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:48,130 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:04:48,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,133 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-10 23:04:48,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:48,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:48,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:48,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:48,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:48,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:48,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:48,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:48,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:48,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:48,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,162 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-10 23:04:48,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:48,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:48,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:48,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:48,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:48,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:48,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:48,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:48,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:04:48,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-10 23:04:48,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,186 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-10 23:04:48,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:48,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:48,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:48,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:48,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:48,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:48,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:48,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:48,203 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:04:48,207 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-10 23:04:48,207 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-10 23:04:48,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,208 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-10 23:04:48,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:04:48,209 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:04:48,209 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:04:48,210 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2024-11-10 23:04:48,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:48,220 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:04:48,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:48,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:04:48,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:48,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:04:48,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:48,328 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-10 23:04:48,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 85 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:48,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 85 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 149 states and 170 transitions. Complement of second has 6 states. [2024-11-10 23:04:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:04:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2024-11-10 23:04:48,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 5 letters. Loop has 16 letters. [2024-11-10 23:04:48,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:48,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 21 letters. Loop has 16 letters. [2024-11-10 23:04:48,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:48,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 5 letters. Loop has 32 letters. [2024-11-10 23:04:48,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:48,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 170 transitions. [2024-11-10 23:04:48,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-11-10 23:04:48,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 144 states and 164 transitions. [2024-11-10 23:04:48,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-10 23:04:48,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-10 23:04:48,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 164 transitions. [2024-11-10 23:04:48,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:04:48,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 164 transitions. [2024-11-10 23:04:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 164 transitions. [2024-11-10 23:04:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2024-11-10 23:04:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 1.1428571428571428) internal successors, (160), 139 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2024-11-10 23:04:48,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 140 states and 160 transitions. [2024-11-10 23:04:48,379 INFO L425 stractBuchiCegarLoop]: Abstraction has 140 states and 160 transitions. [2024-11-10 23:04:48,379 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 23:04:48,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 160 transitions. [2024-11-10 23:04:48,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-11-10 23:04:48,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:48,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:48,380 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-10 23:04:48,380 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:48,380 INFO L745 eck$LassoCheckResult]: Stem: 2281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 2282#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 2289#L27-1 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 2215#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 2216#L35 assume true; 2270#L35-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 2240#L38 [2024-11-10 23:04:48,381 INFO L747 eck$LassoCheckResult]: Loop: 2240#L38 assume true; 2283#L38-1 assume !!(main_~j~0#1 <= main_~r~0#1); 2275#L39 assume !(main_~j~0#1 < main_~r~0#1); 2217#L47 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2218#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 2279#L21-9 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2233#L18-8 assume !(0 == __VERIFIER_assert_~cond#1); 2234#L21-8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 2253#L49 assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2254#L18-7 assume !(0 == __VERIFIER_assert_~cond#1); 2264#L21-7 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2249#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 2250#L21-6 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2225#L18-5 assume !(0 == __VERIFIER_assert_~cond#1); 2226#L21-5 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2260#L18-4 assume !(0 == __VERIFIER_assert_~cond#1); 2261#L21-4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1; 2240#L38 [2024-11-10 23:04:48,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash 851562937, now seen corresponding path program 1 times [2024-11-10 23:04:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:48,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836018861] [2024-11-10 23:04:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:48,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:48,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:48,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1393939070, now seen corresponding path program 1 times [2024-11-10 23:04:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543034235] [2024-11-10 23:04:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:48,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:48,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:48,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1022011334, now seen corresponding path program 1 times [2024-11-10 23:04:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:48,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483228121] [2024-11-10 23:04:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:48,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:48,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:48,588 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:48,589 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:48,589 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:48,589 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:48,589 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:04:48,589 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,589 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:48,589 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:48,589 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration7_Loop [2024-11-10 23:04:48,589 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:48,590 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:48,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,650 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:48,650 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:04:48,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,652 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-10 23:04:48,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:48,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:48,667 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:04:48,667 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:04:48,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-10 23:04:48,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,679 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-10 23:04:48,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:48,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:48,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:48,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,711 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-10 23:04:48,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:04:48,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:48,791 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:04:48,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:48,795 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:48,796 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:48,796 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:48,796 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:48,796 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:04:48,796 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,796 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:48,796 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:48,796 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration7_Loop [2024-11-10 23:04:48,796 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:48,796 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:48,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:48,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-10 23:04:48,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-10 23:04:48,874 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:48,874 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:04:48,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,877 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-10 23:04:48,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:48,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:48,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:48,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:48,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:48,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:48,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:48,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:48,895 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:04:48,903 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-10 23:04:48,903 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-10 23:04:48,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:48,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:48,905 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:48,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-10 23:04:48,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:04:48,907 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:04:48,907 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:04:48,908 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~j~0#1) = 3*ULTIMATE.start_main_~n~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-10 23:04:48,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-10 23:04:48,923 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:04:48,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:48,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:04:48,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:48,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 23:04:48,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:49,117 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-10 23:04:49,117 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 160 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:49,336 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 160 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 437 states and 487 transitions. Complement of second has 15 states. [2024-11-10 23:04:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-11-10 23:04:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2024-11-10 23:04:49,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 6 letters. Loop has 17 letters. [2024-11-10 23:04:49,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:49,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 23 letters. Loop has 17 letters. [2024-11-10 23:04:49,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:49,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 6 letters. Loop has 34 letters. [2024-11-10 23:04:49,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:49,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 437 states and 487 transitions. [2024-11-10 23:04:49,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-11-10 23:04:49,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 437 states to 328 states and 371 transitions. [2024-11-10 23:04:49,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-10 23:04:49,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-10 23:04:49,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 371 transitions. [2024-11-10 23:04:49,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:04:49,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 328 states and 371 transitions. [2024-11-10 23:04:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 371 transitions. [2024-11-10 23:04:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 278. [2024-11-10 23:04:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 278 states have (on average 1.143884892086331) internal successors, (318), 277 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 318 transitions. [2024-11-10 23:04:49,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 278 states and 318 transitions. [2024-11-10 23:04:49,355 INFO L425 stractBuchiCegarLoop]: Abstraction has 278 states and 318 transitions. [2024-11-10 23:04:49,355 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 23:04:49,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 318 transitions. [2024-11-10 23:04:49,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-11-10 23:04:49,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:49,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:49,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:49,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:49,360 INFO L745 eck$LassoCheckResult]: Stem: 2967#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 2968#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 2978#L27-1 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 2904#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 2905#L35 assume true; 2924#L35-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 2925#L38 assume true; 3159#L38-1 assume !!(main_~j~0#1 <= main_~r~0#1); 2989#L39 assume !(main_~j~0#1 < main_~r~0#1); 3095#L47 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3058#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 3053#L21-9 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2996#L18-8 assume !(0 == __VERIFIER_assert_~cond#1); 2997#L21-8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 2987#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 2986#L59 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2942#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 2943#L21-3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2928#L18-2 assume !(0 == __VERIFIER_assert_~cond#1); 2929#L21-2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2950#L35 assume true; 2984#L35-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 2980#L38 [2024-11-10 23:04:49,360 INFO L747 eck$LassoCheckResult]: Loop: 2980#L38 assume true; 2965#L38-1 assume !!(main_~j~0#1 <= main_~r~0#1); 2960#L39 assume !(main_~j~0#1 < main_~r~0#1); 2900#L47 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2901#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 2953#L21-9 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2918#L18-8 assume !(0 == __VERIFIER_assert_~cond#1); 2919#L21-8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 2938#L49 assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2939#L18-7 assume !(0 == __VERIFIER_assert_~cond#1); 2948#L21-7 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2934#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 2935#L21-6 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2910#L18-5 assume !(0 == __VERIFIER_assert_~cond#1); 2911#L21-5 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2944#L18-4 assume !(0 == __VERIFIER_assert_~cond#1); 2945#L21-4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1; 2980#L38 [2024-11-10 23:04:49,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1869975691, now seen corresponding path program 2 times [2024-11-10 23:04:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:49,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930842118] [2024-11-10 23:04:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:49,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930842118] [2024-11-10 23:04:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930842118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:49,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:49,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 23:04:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014478651] [2024-11-10 23:04:49,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:49,434 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 23:04:49,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1393939070, now seen corresponding path program 2 times [2024-11-10 23:04:49,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944181739] [2024-11-10 23:04:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:49,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:49,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:49,583 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:49,583 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:49,584 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:49,584 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:49,584 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:04:49,584 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:49,584 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:49,584 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:49,584 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2024-11-10 23:04:49,584 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:49,584 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:49,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:49,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:49,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:49,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:49,638 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:49,639 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:04:49,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:49,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:49,641 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:49,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-10 23:04:49,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:04:49,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:49,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:49,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:49,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:49,672 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:49,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-10 23:04:49,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:04:49,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:04:49,750 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:04:49,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:49,755 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:04:49,755 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:04:49,755 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:04:49,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:04:49,756 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:04:49,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:49,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:04:49,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:04:49,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2024-11-10 23:04:49,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:04:49,756 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:04:49,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:49,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:49,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:49,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:04:49,812 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:04:49,812 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:04:49,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:49,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:49,814 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:49,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-10 23:04:49,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:04:49,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:04:49,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:04:49,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:04:49,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:04:49,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:04:49,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:04:49,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:04:49,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:04:49,833 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-10 23:04:49,833 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-10 23:04:49,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:49,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:49,834 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:49,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-10 23:04:49,836 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:04:49,836 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:04:49,836 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:04:49,836 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~j~0#1) = 3*ULTIMATE.start_main_~n~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-10 23:04:49,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-10 23:04:49,850 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:04:49,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:49,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:04:49,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:49,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 23:04:49,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:50,034 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-10 23:04:50,034 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 318 transitions. cyclomatic complexity: 47 Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:50,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-10 23:04:50,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-10 23:04:50,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 318 transitions. cyclomatic complexity: 47. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 501 states and 563 transitions. Complement of second has 15 states. [2024-11-10 23:04:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-11-10 23:04:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2024-11-10 23:04:50,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 22 letters. Loop has 17 letters. [2024-11-10 23:04:50,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:50,274 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:04:50,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:50,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:04:50,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:50,344 WARN L253 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 23:04:50,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:50,606 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-10 23:04:50,606 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 318 transitions. cyclomatic complexity: 47 Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:51,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 318 transitions. cyclomatic complexity: 47. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 592 states and 655 transitions. Complement of second has 33 states. [2024-11-10 23:04:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2024-11-10 23:04:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2024-11-10 23:04:51,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 67 transitions. Stem has 22 letters. Loop has 17 letters. [2024-11-10 23:04:51,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:51,123 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:04:51,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:51,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:04:51,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:51,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 23:04:51,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:51,308 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-10 23:04:51,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 318 transitions. cyclomatic complexity: 47 Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:51,528 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 318 transitions. cyclomatic complexity: 47. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 796 states and 880 transitions. Complement of second has 16 states. [2024-11-10 23:04:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-10 23:04:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-11-10 23:04:51,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 110 transitions. Stem has 22 letters. Loop has 17 letters. [2024-11-10 23:04:51,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:51,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 110 transitions. Stem has 39 letters. Loop has 17 letters. [2024-11-10 23:04:51,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:51,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 110 transitions. Stem has 22 letters. Loop has 34 letters. [2024-11-10 23:04:51,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:04:51,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 796 states and 880 transitions. [2024-11-10 23:04:51,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:04:51,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 796 states to 0 states and 0 transitions. [2024-11-10 23:04:51,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 23:04:51,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 23:04:51,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 23:04:51,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:04:51,540 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:04:51,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:04:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 23:04:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 23:04:51,542 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:51,542 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-11-10 23:04:51,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-11-10 23:04:51,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:04:51,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 23:04:51,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 23:04:51,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 23:04:51,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 23:04:51,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:04:51,543 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:04:51,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:04:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 23:04:51,544 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:04:51,544 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 23:04:51,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 23:04:51,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:04:51,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 23:04:51,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:04:51 BoogieIcfgContainer [2024-11-10 23:04:51,552 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:04:51,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:04:51,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:04:51,553 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:04:51,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:43" (3/4) ... [2024-11-10 23:04:51,556 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 23:04:51,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:04:51,557 INFO L158 Benchmark]: Toolchain (without parser) took 8603.01ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 114.1MB in the beginning and 246.5MB in the end (delta: -132.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:04:51,558 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:04:51,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.63ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 101.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 23:04:51,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.31ms. Allocated memory is still 172.0MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:04:51,559 INFO L158 Benchmark]: Boogie Preprocessor took 33.92ms. Allocated memory is still 172.0MB. Free memory was 99.3MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:04:51,559 INFO L158 Benchmark]: IcfgBuilder took 404.38ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 81.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 23:04:51,560 INFO L158 Benchmark]: BuchiAutomizer took 7846.34ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 80.5MB in the beginning and 246.5MB in the end (delta: -165.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:04:51,560 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 293.6MB. Free memory is still 246.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:04:51,561 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.63ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 101.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.31ms. Allocated memory is still 172.0MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.92ms. Allocated memory is still 172.0MB. Free memory was 99.3MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 404.38ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 81.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 7846.34ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 80.5MB in the beginning and 246.5MB in the end (delta: -165.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 293.6MB. Free memory is still 246.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * j) + ((long long) 3 * n)) and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + ((long long) 3 * n)) and consists of 9 locations. 6 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.7s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 285 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 948 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 940 mSDsluCounter, 1304 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 599 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 983 IncrementalHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 705 mSDtfsCounter, 983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf92 smp100 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-10 23:04:51,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE