./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-12 00:45:36,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:45:36,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:45:36,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:45:36,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:45:36,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:45:36,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:45:36,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:45:36,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:45:36,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:45:36,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:45:36,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:45:36,331 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:45:36,332 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:45:36,332 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:45:36,332 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:45:36,333 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:45:36,333 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:45:36,333 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:45:36,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:45:36,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:45:36,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:45:36,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:45:36,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:45:36,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:45:36,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:45:36,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:45:36,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:45:36,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:45:36,339 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:45:36,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:45:36,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:45:36,340 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:45:36,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:45:36,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:45:36,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:45:36,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:45:36,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:45:36,341 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:45:36,342 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-clean/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-clean/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-10-12 00:45:36,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:45:36,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:45:36,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:45:36,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:45:36,618 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:45:36,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-10-12 00:45:38,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:45:38,334 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:45:38,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-10-12 00:45:38,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e57669f15/f947e83b0d4c4e1a8a988803125e0964/FLAG38a3f9f2e [2024-10-12 00:45:38,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e57669f15/f947e83b0d4c4e1a8a988803125e0964 [2024-10-12 00:45:38,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:45:38,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:45:38,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:45:38,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:45:38,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:45:38,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef1786d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38, skipping insertion in model container [2024-10-12 00:45:38,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:45:38,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:45:38,567 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:45:38,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:45:38,598 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:45:38,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38 WrapperNode [2024-10-12 00:45:38,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:45:38,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:45:38,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:45:38,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:45:38,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,636 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 17, calls inlined = 30, statements flattened = 187 [2024-10-12 00:45:38,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:45:38,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:45:38,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:45:38,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:45:38,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,669 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-10-12 00:45:38,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:45:38,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:45:38,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:45:38,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:45:38,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (1/1) ... [2024-10-12 00:45:38,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:38,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:38,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:38,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:45:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:45:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:45:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:45:38,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:45:38,847 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:45:38,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:45:39,141 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-12 00:45:39,141 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:45:39,163 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:45:39,164 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:45:39,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:39 BoogieIcfgContainer [2024-10-12 00:45:39,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:45:39,166 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:45:39,167 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:45:39,171 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:45:39,172 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:39,172 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:45:38" (1/3) ... [2024-10-12 00:45:39,174 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f0a0b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:45:39, skipping insertion in model container [2024-10-12 00:45:39,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:39,175 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:38" (2/3) ... [2024-10-12 00:45:39,175 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f0a0b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:45:39, skipping insertion in model container [2024-10-12 00:45:39,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:39,175 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:39" (3/3) ... [2024-10-12 00:45:39,176 INFO L332 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2024-10-12 00:45:39,249 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:45:39,250 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:45:39,250 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:45:39,250 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:45:39,250 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:45:39,250 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:45:39,251 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:45:39,251 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:45:39,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 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-10-12 00:45:39,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-10-12 00:45:39,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:39,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:39,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:45:39,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:39,283 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:45:39,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 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-10-12 00:45:39,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-10-12 00:45:39,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:39,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:39,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:45:39,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:39,295 INFO L745 eck$LassoCheckResult]: Stem: 40#$Ultimate##0true 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); 52#L-1true 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; 24#L27true 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; 17#L59-1true [2024-10-12 00:45:39,296 INFO L747 eck$LassoCheckResult]: Loop: 17#L59-1true assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 72#L38-2true assume !(main_~j~0#1 <= main_~r~0#1); 49#L38-3true 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; 16#L18-30true assume !(0 == __VERIFIER_assert_~cond#1); 25#L18-32true 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; 46#L18-33true assume !(0 == __VERIFIER_assert_~cond#1); 14#L18-35true 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; 17#L59-1true [2024-10-12 00:45:39,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-10-12 00:45:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:39,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817258289] [2024-10-12 00:45:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:39,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:39,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:39,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:39,441 INFO L85 PathProgramCache]: Analyzing trace with hash -78633890, now seen corresponding path program 1 times [2024-10-12 00:45:39,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:39,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82603398] [2024-10-12 00:45:39,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:39,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:39,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1881186967, now seen corresponding path program 1 times [2024-10-12 00:45:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861638291] [2024-10-12 00:45:39,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:39,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:39,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861638291] [2024-10-12 00:45:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861638291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:39,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:39,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:45:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423155924] [2024-10-12 00:45:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:39,862 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:39,863 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:39,863 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:39,863 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:39,863 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:39,864 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:39,864 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:39,864 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:39,864 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration1_Loop [2024-10-12 00:45:39,864 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:39,864 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:39,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:39,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:39,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:39,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:39,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:39,986 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:39,986 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:39,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:39,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:39,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:45:39,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:39,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:40,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:45:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:40,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:45:40,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:40,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:40,160 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:40,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:40,165 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:40,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:40,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:40,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:40,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:40,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:40,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:40,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:40,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration1_Loop [2024-10-12 00:45:40,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:40,166 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:40,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:40,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:40,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:40,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:40,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:40,255 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:40,260 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:40,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:40,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:40,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:40,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:45:40,268 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-10-12 00:45:40,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:40,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:40,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:40,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:40,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:40,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:40,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:40,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:40,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:45:40,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:40,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:40,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:45:40,310 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-10-12 00:45:40,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:40,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:40,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:40,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:40,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:40,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:40,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:40,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:40,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:45:40,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:40,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:40,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:40,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:45:40,341 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-10-12 00:45:40,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:40,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:40,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:40,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:40,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:40,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:40,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:40,363 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:40,370 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:45:40,371 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:40,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:40,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:40,393 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:40,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:45:40,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:40,396 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:40,396 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:40,397 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-10-12 00:45:40,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:40,414 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:40,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:40,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:40,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:40,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:45:40,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:40,561 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-10-12 00:45:40,564 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 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 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-10-12 00:45:40,665 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 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 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 304 states and 425 transitions. Complement of second has 8 states. [2024-10-12 00:45:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-10-12 00:45:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 327 transitions. [2024-10-12 00:45:40,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 327 transitions. Stem has 4 letters. Loop has 7 letters. [2024-10-12 00:45:40,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:40,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 327 transitions. Stem has 11 letters. Loop has 7 letters. [2024-10-12 00:45:40,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:40,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 327 transitions. Stem has 4 letters. Loop has 14 letters. [2024-10-12 00:45:40,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:40,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 425 transitions. [2024-10-12 00:45:40,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2024-10-12 00:45:40,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 108 states and 126 transitions. [2024-10-12 00:45:40,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-10-12 00:45:40,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-10-12 00:45:40,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 126 transitions. [2024-10-12 00:45:40,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:40,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 126 transitions. [2024-10-12 00:45:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 126 transitions. [2024-10-12 00:45:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-12 00:45:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.158878504672897) internal successors, (124), 106 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-10-12 00:45:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2024-10-12 00:45:40,743 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 124 transitions. [2024-10-12 00:45:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:45:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:45:40,748 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-12 00:45:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:40,770 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2024-10-12 00:45:40,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 148 transitions. [2024-10-12 00:45:40,771 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2024-10-12 00:45:40,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 98 states and 112 transitions. [2024-10-12 00:45:40,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2024-10-12 00:45:40,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2024-10-12 00:45:40,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 112 transitions. [2024-10-12 00:45:40,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:40,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-10-12 00:45:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 112 transitions. [2024-10-12 00:45:40,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2024-10-12 00:45:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 65 states have internal predecessors, (76), 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-10-12 00:45:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-10-12 00:45:40,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-10-12 00:45:40,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:45:40,779 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-10-12 00:45:40,779 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:45:40,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 76 transitions. [2024-10-12 00:45:40,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2024-10-12 00:45:40,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:40,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:40,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:45:40,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:40,780 INFO L745 eck$LassoCheckResult]: Stem: 724#$Ultimate##0 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); 699#L-1 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; 700#L27 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; 688#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; 689#L59-1 [2024-10-12 00:45:40,780 INFO L747 eck$LassoCheckResult]: Loop: 689#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 729#L38-2 assume !(main_~j~0#1 <= main_~r~0#1); 726#L38-3 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; 706#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 707#L18-32 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; 686#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 687#L18-35 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; 689#L59-1 [2024-10-12 00:45:40,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:40,781 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-10-12 00:45:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302924197] [2024-10-12 00:45:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:40,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:40,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:40,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash -78633890, now seen corresponding path program 2 times [2024-10-12 00:45:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938272970] [2024-10-12 00:45:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:40,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:40,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:40,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1604433703, now seen corresponding path program 1 times [2024-10-12 00:45:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613785764] [2024-10-12 00:45:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:40,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:40,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613785764] [2024-10-12 00:45:40,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613785764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:40,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:40,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:45:40,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519573943] [2024-10-12 00:45:40,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:41,081 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:41,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:41,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:41,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:41,082 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:41,083 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,083 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:41,083 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:41,083 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2024-10-12 00:45:41,083 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:41,083 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:41,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,151 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:41,152 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,154 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:45:41,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:41,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:41,171 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:41,172 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-10-12 00:45:41,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:45:41,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:45:41,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:41,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:41,201 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:41,202 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-10-12 00:45:41,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,214 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:45:41,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:41,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:41,227 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:41,227 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-10-12 00:45:41,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:45:41,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,239 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:45:41,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:41,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:41,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:45:41,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,267 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:45:41,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:41,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:41,404 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:41,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:45:41,410 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:41,410 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:41,410 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:41,410 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:41,410 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:41,410 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,410 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:41,410 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:41,410 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2024-10-12 00:45:41,411 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:41,411 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:41,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:41,475 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:41,475 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:41,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,478 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:45:41,482 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-10-12 00:45:41,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:41,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:41,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:41,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:41,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:41,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:41,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:41,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:41,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:45:41,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,515 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:45:41,517 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-10-12 00:45:41,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:41,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:41,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:41,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:41,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:41,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:41,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:41,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:41,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:45:41,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,549 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:45:41,551 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-10-12 00:45:41,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:41,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:41,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:41,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:41,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:41,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:41,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:41,571 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:41,578 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:45:41,605 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:41,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:41,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:41,607 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:41,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:45:41,611 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:41,612 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:41,612 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:41,613 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-10-12 00:45:41,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:41,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:41,625 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:41,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:41,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:41,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:41,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:45:41,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:41,715 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-10-12 00:45:41,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-10-12 00:45:41,751 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 160 states and 185 transitions. Complement of second has 6 states. [2024-10-12 00:45:41,754 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-10-12 00:45:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-10-12 00:45:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-10-12 00:45:41,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2024-10-12 00:45:41,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:41,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2024-10-12 00:45:41,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:41,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2024-10-12 00:45:41,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:41,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 185 transitions. [2024-10-12 00:45:41,758 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2024-10-12 00:45:41,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 125 states and 145 transitions. [2024-10-12 00:45:41,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-10-12 00:45:41,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-10-12 00:45:41,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 145 transitions. [2024-10-12 00:45:41,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:41,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 145 transitions. [2024-10-12 00:45:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 145 transitions. [2024-10-12 00:45:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 67. [2024-10-12 00:45:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 states have internal predecessors, (78), 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-10-12 00:45:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2024-10-12 00:45:41,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2024-10-12 00:45:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:45:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:45:41,771 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-10-12 00:45:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:41,920 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2024-10-12 00:45:41,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 231 transitions. [2024-10-12 00:45:41,924 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2024-10-12 00:45:41,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 231 transitions. [2024-10-12 00:45:41,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2024-10-12 00:45:41,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2024-10-12 00:45:41,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 231 transitions. [2024-10-12 00:45:41,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:41,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 207 states and 231 transitions. [2024-10-12 00:45:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 231 transitions. [2024-10-12 00:45:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 69. [2024-10-12 00:45:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 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-10-12 00:45:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-10-12 00:45:41,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-10-12 00:45:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:45:41,942 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-10-12 00:45:41,942 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:45:41,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2024-10-12 00:45:41,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-10-12 00:45:41,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:41,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:41,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:45:41,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:41,944 INFO L745 eck$LassoCheckResult]: Stem: 1314#$Ultimate##0 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); 1267#L-1 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; 1268#L27 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; 1250#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; 1252#L59-1 [2024-10-12 00:45:41,944 INFO L747 eck$LassoCheckResult]: Loop: 1252#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1284#L38-2 assume !(main_~j~0#1 <= main_~r~0#1); 1253#L38-3 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; 1254#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1265#L18-38 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; 1266#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1269#L18-41 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; 1252#L59-1 [2024-10-12 00:45:41,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2024-10-12 00:45:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:41,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110845891] [2024-10-12 00:45:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:41,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:41,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -44278910, now seen corresponding path program 1 times [2024-10-12 00:45:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222856192] [2024-10-12 00:45:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:41,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:41,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222856192] [2024-10-12 00:45:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222856192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:41,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:41,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:45:41,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673290426] [2024-10-12 00:45:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:41,987 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:45:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:45:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:45:41,988 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-10-12 00:45:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:42,051 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2024-10-12 00:45:42,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 146 transitions. [2024-10-12 00:45:42,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2024-10-12 00:45:42,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 128 states and 145 transitions. [2024-10-12 00:45:42,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-10-12 00:45:42,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-10-12 00:45:42,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2024-10-12 00:45:42,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:42,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 145 transitions. [2024-10-12 00:45:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2024-10-12 00:45:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 69. [2024-10-12 00:45:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 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-10-12 00:45:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-10-12 00:45:42,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-10-12 00:45:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:45:42,057 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-10-12 00:45:42,058 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:45:42,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2024-10-12 00:45:42,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-10-12 00:45:42,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:42,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:42,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:45:42,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:42,059 INFO L745 eck$LassoCheckResult]: Stem: 1521#$Ultimate##0 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); 1474#L-1 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; 1475#L27 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; 1457#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; 1459#L59-1 [2024-10-12 00:45:42,059 INFO L747 eck$LassoCheckResult]: Loop: 1459#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1491#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 1499#L39 assume !(main_~j~0#1 < main_~r~0#1); 1469#L39-1 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; 1477#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 1478#L18-14 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; 1511#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 1512#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 1497#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 1464#L38-3 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; 1465#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1472#L18-38 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; 1473#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1476#L18-41 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; 1459#L59-1 [2024-10-12 00:45:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2024-10-12 00:45:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354948034] [2024-10-12 00:45:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:42,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:42,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:42,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:42,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1259032696, now seen corresponding path program 1 times [2024-10-12 00:45:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:42,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015077936] [2024-10-12 00:45:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:42,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:42,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:42,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 727543599, now seen corresponding path program 1 times [2024-10-12 00:45:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:42,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591690107] [2024-10-12 00:45:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:42,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:42,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591690107] [2024-10-12 00:45:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591690107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:42,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:42,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:45:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530380920] [2024-10-12 00:45:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:42,309 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:42,309 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:42,309 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:42,310 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:42,310 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:42,310 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,310 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:42,310 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:42,310 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2024-10-12 00:45:42,310 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:42,310 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:42,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,383 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:42,383 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:42,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,385 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:45:42,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:42,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:42,408 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:42,409 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-10-12 00:45:42,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:45:42,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,425 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:45:42,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:42,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:42,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:45:42,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,463 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:45:42,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:42,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:42,511 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:42,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:45:42,517 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:42,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:42,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:42,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:42,518 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:42,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:42,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:42,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2024-10-12 00:45:42,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:42,518 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:42,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:42,592 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:42,592 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:42,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,594 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:45:42,597 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-10-12 00:45:42,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:42,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:42,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:42,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:42,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:42,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:42,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:42,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:42,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:45:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,628 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:45:42,631 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-10-12 00:45:42,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:42,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:42,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:42,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:42,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:42,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:42,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:42,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:42,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:45:42,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,662 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:45:42,664 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-10-12 00:45:42,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:42,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:42,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:42,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:42,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:42,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:42,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:42,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:42,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:42,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,694 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:45:42,696 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-10-12 00:45:42,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:42,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:42,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:42,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:42,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:42,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:42,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:42,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:42,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:45:42,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,720 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:45:42,721 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-10-12 00:45:42,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:42,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:42,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:42,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:42,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:42,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:42,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:42,738 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:42,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:45:42,742 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:42,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:42,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:42,744 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:42,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:45:42,745 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:42,745 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:42,745 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:42,745 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-10-12 00:45:42,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:42,757 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:42,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:42,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:42,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:42,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:45:42,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:42,864 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-10-12 00:45:42,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-12 00:45:42,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 133 states and 153 transitions. Complement of second has 4 states. [2024-10-12 00:45:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-12 00:45:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-10-12 00:45:42,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 14 letters. [2024-10-12 00:45:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 18 letters. Loop has 14 letters. [2024-10-12 00:45:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 28 letters. [2024-10-12 00:45:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:42,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2024-10-12 00:45:42,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2024-10-12 00:45:42,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 128 states and 147 transitions. [2024-10-12 00:45:42,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-10-12 00:45:42,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-10-12 00:45:42,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 147 transitions. [2024-10-12 00:45:42,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:42,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 147 transitions. [2024-10-12 00:45:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 147 transitions. [2024-10-12 00:45:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-10-12 00:45:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 126 states have internal predecessors, (146), 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-10-12 00:45:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2024-10-12 00:45:42,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 146 transitions. [2024-10-12 00:45:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:42,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:45:42,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:45:42,957 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-12 00:45:42,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:42,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:42,992 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2024-10-12 00:45:42,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2024-10-12 00:45:42,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-10-12 00:45:42,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2024-10-12 00:45:42,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-10-12 00:45:42,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-12 00:45:42,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2024-10-12 00:45:42,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:42,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-12 00:45:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2024-10-12 00:45:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-12 00:45:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 68 states have internal predecessors, (79), 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-10-12 00:45:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-10-12 00:45:42,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-12 00:45:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:45:42,999 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-12 00:45:42,999 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:45:42,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2024-10-12 00:45:43,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-10-12 00:45:43,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:43,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:43,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:45:43,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:43,000 INFO L745 eck$LassoCheckResult]: Stem: 1997#$Ultimate##0 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); 1949#L-1 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; 1950#L27 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; 1933#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; 1934#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1967#L38-2 [2024-10-12 00:45:43,000 INFO L747 eck$LassoCheckResult]: Loop: 1967#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 1979#L39 assume !(main_~j~0#1 < main_~r~0#1); 1944#L39-1 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; 1952#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 1953#L18-14 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; 1987#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 1988#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 1973#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 1939#L38-3 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; 1940#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1947#L18-38 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; 1948#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1951#L18-41 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; 1961#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1967#L38-2 [2024-10-12 00:45:43,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 1 times [2024-10-12 00:45:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423299887] [2024-10-12 00:45:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:43,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:43,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:43,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash 48961178, now seen corresponding path program 2 times [2024-10-12 00:45:43,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:43,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765932896] [2024-10-12 00:45:43,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:43,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:43,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:43,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:43,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2100083464, now seen corresponding path program 1 times [2024-10-12 00:45:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:43,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184081190] [2024-10-12 00:45:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:43,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184081190] [2024-10-12 00:45:43,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184081190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:43,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:43,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:45:43,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533483924] [2024-10-12 00:45:43,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:43,253 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:43,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:43,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:43,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:43,254 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:43,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:43,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:43,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2024-10-12 00:45:43,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:43,254 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:43,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,334 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:43,334 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:43,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:43,337 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:43,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:45:43,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:43,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:43,356 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:43,356 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-10-12 00:45:43,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:43,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:43,368 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:43,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:45:43,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:43,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:43,380 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:43,380 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-10-12 00:45:43,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 00:45:43,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:43,393 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:43,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:45:43,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:43,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:43,409 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:43,410 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-10-12 00:45:43,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:45:43,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:43,427 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:43,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:45:43,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:43,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:43,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:43,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:43,462 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:43,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:45:43,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:43,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:43,678 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:43,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:43,684 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:43,684 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:43,684 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:43,684 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:43,684 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:43,684 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,684 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:43,685 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:43,685 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2024-10-12 00:45:43,685 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:43,685 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:43,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:43,758 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:43,758 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:43,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:43,761 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:43,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:45:43,764 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-10-12 00:45:43,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:43,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:43,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:43,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:43,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:43,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:43,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:43,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:43,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:43,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:43,790 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:43,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:45:43,791 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-10-12 00:45:43,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:43,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:43,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:43,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:43,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:43,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:43,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:43,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:43,810 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:45:43,810 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:45:43,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:43,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:43,812 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:43,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:45:43,814 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:43,814 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:43,814 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:43,814 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-10-12 00:45:43,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:43,830 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:43,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:43,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:43,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:43,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:45:43,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:43,946 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-10-12 00:45:43,946 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-10-12 00:45:44,113 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 400 states and 442 transitions. Complement of second has 17 states. [2024-10-12 00:45:44,114 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-10-12 00:45:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-10-12 00:45:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-10-12 00:45:44,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 5 letters. Loop has 14 letters. [2024-10-12 00:45:44,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:44,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 19 letters. Loop has 14 letters. [2024-10-12 00:45:44,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:44,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 5 letters. Loop has 28 letters. [2024-10-12 00:45:44,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:44,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 442 transitions. [2024-10-12 00:45:44,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2024-10-12 00:45:44,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 330 states and 371 transitions. [2024-10-12 00:45:44,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2024-10-12 00:45:44,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2024-10-12 00:45:44,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 371 transitions. [2024-10-12 00:45:44,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:44,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 330 states and 371 transitions. [2024-10-12 00:45:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 371 transitions. [2024-10-12 00:45:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 197. [2024-10-12 00:45:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 197 states have (on average 1.1573604060913705) internal successors, (228), 196 states have internal predecessors, (228), 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-10-12 00:45:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2024-10-12 00:45:44,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 197 states and 228 transitions. [2024-10-12 00:45:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:45:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:45:44,139 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-10-12 00:45:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:44,289 INFO L93 Difference]: Finished difference Result 657 states and 728 transitions. [2024-10-12 00:45:44,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 657 states and 728 transitions. [2024-10-12 00:45:44,293 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2024-10-12 00:45:44,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 657 states to 593 states and 657 transitions. [2024-10-12 00:45:44,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2024-10-12 00:45:44,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2024-10-12 00:45:44,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 657 transitions. [2024-10-12 00:45:44,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:44,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 593 states and 657 transitions. [2024-10-12 00:45:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 657 transitions. [2024-10-12 00:45:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 189. [2024-10-12 00:45:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.1534391534391535) internal successors, (218), 188 states have internal predecessors, (218), 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-10-12 00:45:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2024-10-12 00:45:44,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 189 states and 218 transitions. [2024-10-12 00:45:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:45:44,311 INFO L425 stractBuchiCegarLoop]: Abstraction has 189 states and 218 transitions. [2024-10-12 00:45:44,311 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:45:44,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 218 transitions. [2024-10-12 00:45:44,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-10-12 00:45:44,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:44,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:44,313 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:45:44,313 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:44,313 INFO L745 eck$LassoCheckResult]: Stem: 3436#$Ultimate##0 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); 3387#L-1 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; 3388#L27 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; 3370#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; 3371#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 3404#L38-2 [2024-10-12 00:45:44,313 INFO L747 eck$LassoCheckResult]: Loop: 3404#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 3489#L39 assume main_~j~0#1 < main_~r~0#1;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; 3470#L18 assume !(0 == __VERIFIER_assert_~cond#1); 3487#L18-2 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; 3485#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 3483#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3481#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 3479#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3477#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 3475#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 3469#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 3465#L39-1 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; 3461#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 3457#L18-14 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; 3453#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 3449#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 3439#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 3376#L38-3 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; 3377#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 3384#L18-38 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; 3385#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 3386#L18-41 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; 3398#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 3404#L38-2 [2024-10-12 00:45:44,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 2 times [2024-10-12 00:45:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435829583] [2024-10-12 00:45:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:44,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:44,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:44,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 69489122, now seen corresponding path program 1 times [2024-10-12 00:45:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778990782] [2024-10-12 00:45:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:44,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:44,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:44,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:44,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2029401804, now seen corresponding path program 1 times [2024-10-12 00:45:44,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:44,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484576079] [2024-10-12 00:45:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:44,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:44,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:44,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:45:44,642 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:44,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:44,642 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:44,642 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:44,642 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:44,643 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:44,643 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:44,643 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:44,643 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2024-10-12 00:45:44,643 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:44,643 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:44,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,726 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:44,726 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:44,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:44,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:44,728 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:44,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:45:44,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:44,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:44,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:45:44,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:44,764 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:44,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:45:44,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:44,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:44,857 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:44,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:44,862 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:44,862 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:44,862 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:44,862 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:44,862 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:44,862 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:44,862 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:44,862 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:44,862 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2024-10-12 00:45:44,862 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:44,862 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:44,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:44,942 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:44,942 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:44,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:44,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:44,944 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:44,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:45:44,946 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-10-12 00:45:44,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:44,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:44,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:44,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:44,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:44,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:44,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:44,961 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:44,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:45:44,965 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:44,966 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:44,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:45:44,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:44,967 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:44,967 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:44,967 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-10-12 00:45:44,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-12 00:45:44,981 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:44,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:45,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:45,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:45,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:45:45,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:45,077 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-10-12 00:45:45,077 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 189 states and 218 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-12 00:45:45,106 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 189 states and 218 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 376 states and 436 transitions. Complement of second has 6 states. [2024-10-12 00:45:45,106 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-10-12 00:45:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-12 00:45:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2024-10-12 00:45:45,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 23 letters. [2024-10-12 00:45:45,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:45,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 28 letters. Loop has 23 letters. [2024-10-12 00:45:45,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:45,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 46 letters. [2024-10-12 00:45:45,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:45,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 376 states and 436 transitions. [2024-10-12 00:45:45,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-10-12 00:45:45,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 376 states to 252 states and 292 transitions. [2024-10-12 00:45:45,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-10-12 00:45:45,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-10-12 00:45:45,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 292 transitions. [2024-10-12 00:45:45,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:45,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 252 states and 292 transitions. [2024-10-12 00:45:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 292 transitions. [2024-10-12 00:45:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 132. [2024-10-12 00:45:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 131 states have internal predecessors, (153), 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-10-12 00:45:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2024-10-12 00:45:45,118 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 153 transitions. [2024-10-12 00:45:45,118 INFO L425 stractBuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2024-10-12 00:45:45,118 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:45:45,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 153 transitions. [2024-10-12 00:45:45,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:45,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:45,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:45,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:45:45,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:45,119 INFO L745 eck$LassoCheckResult]: Stem: 4116#$Ultimate##0 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); 4055#L-1 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; 4056#L27 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; 4041#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; 4042#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 4075#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 4086#L39 [2024-10-12 00:45:45,120 INFO L747 eck$LassoCheckResult]: Loop: 4086#L39 assume !(main_~j~0#1 < main_~r~0#1); 4050#L39-1 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; 4058#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 4059#L18-14 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; 4098#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 4099#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 4083#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; 4070#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 4071#L18-20 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; 4090#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 4091#L18-23 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; 4094#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 4095#L18-26 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; 4117#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 4111#L18-29 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; 4076#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 4086#L39 [2024-10-12 00:45:45,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 1 times [2024-10-12 00:45:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127187196] [2024-10-12 00:45:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:45,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:45,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 93725893, now seen corresponding path program 1 times [2024-10-12 00:45:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:45,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951518530] [2024-10-12 00:45:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:45,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951518530] [2024-10-12 00:45:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951518530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:45,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:45,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:45:45,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915984167] [2024-10-12 00:45:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:45,214 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:45:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:45,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:45:45,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:45:45,215 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. cyclomatic complexity: 25 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-10-12 00:45:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:45,315 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2024-10-12 00:45:45,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 235 transitions. [2024-10-12 00:45:45,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:45,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 195 states and 220 transitions. [2024-10-12 00:45:45,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-10-12 00:45:45,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-12 00:45:45,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 220 transitions. [2024-10-12 00:45:45,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:45,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 220 transitions. [2024-10-12 00:45:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 220 transitions. [2024-10-12 00:45:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2024-10-12 00:45:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.1299435028248588) internal successors, (200), 176 states have internal predecessors, (200), 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-10-12 00:45:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2024-10-12 00:45:45,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 177 states and 200 transitions. [2024-10-12 00:45:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:45:45,323 INFO L425 stractBuchiCegarLoop]: Abstraction has 177 states and 200 transitions. [2024-10-12 00:45:45,324 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:45:45,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 200 transitions. [2024-10-12 00:45:45,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:45,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:45,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:45,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:45:45,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:45,325 INFO L745 eck$LassoCheckResult]: Stem: 4468#$Ultimate##0 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); 4412#L-1 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; 4413#L27 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; 4398#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; 4399#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 4431#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 4440#L39 [2024-10-12 00:45:45,325 INFO L747 eck$LassoCheckResult]: Loop: 4440#L39 assume main_~j~0#1 < main_~r~0#1;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; 4441#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4433#L18-2 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; 4434#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 4400#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4401#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 4419#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4420#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 4460#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 4406#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 4407#L39-1 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; 4415#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 4416#L18-14 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; 4452#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 4453#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 4438#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; 4426#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 4427#L18-20 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; 4444#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 4445#L18-23 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; 4448#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 4449#L18-26 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; 4469#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 4462#L18-29 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; 4463#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 4440#L39 [2024-10-12 00:45:45,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 2 times [2024-10-12 00:45:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:45,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610426449] [2024-10-12 00:45:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:45,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:45,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:45,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash -510635659, now seen corresponding path program 1 times [2024-10-12 00:45:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:45,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346334933] [2024-10-12 00:45:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:45,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:45,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:45,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash -575128537, now seen corresponding path program 1 times [2024-10-12 00:45:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983178648] [2024-10-12 00:45:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:45,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983178648] [2024-10-12 00:45:45,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983178648] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:45:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013329482] [2024-10-12 00:45:45,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:45,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:45:45,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:45,480 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:45:45,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-10-12 00:45:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:45,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:45:45,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:45,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-12 00:45:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:45,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 00:45:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013329482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:45,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 00:45:45,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-10-12 00:45:45,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463636183] [2024-10-12 00:45:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:46,013 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:46,013 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:46,013 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:46,013 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:46,014 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:46,014 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,014 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:46,014 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:46,014 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2024-10-12 00:45:46,014 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:46,014 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:46,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,075 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:46,075 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:46,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,077 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:45:46,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:46,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:46,095 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:46,096 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-10-12 00:45:46,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:46,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,112 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:45:46,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:46,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:46,132 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:46,132 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:46,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:46,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,149 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:45:46,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:46,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:46,167 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:46,167 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-10-12 00:45:46,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,184 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:45:46,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:46,187 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:46,198 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:46,198 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-10-12 00:45:46,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:46,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,210 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:45:46,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:46,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:46,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:46,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,243 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:45:46,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:46,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:46,325 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:46,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-12 00:45:46,329 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:46,330 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:46,330 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:46,330 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:46,330 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:46,330 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,330 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:46,330 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:46,330 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2024-10-12 00:45:46,330 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:46,330 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:46,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:46,390 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:46,390 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:46,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,392 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:45:46,394 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-10-12 00:45:46,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:46,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:46,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:46,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:46,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:46,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:46,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:46,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:46,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:46,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,417 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:45:46,419 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-10-12 00:45:46,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:46,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:46,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:46,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:46,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:46,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:46,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:46,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:46,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-12 00:45:46,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,442 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:45:46,444 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-10-12 00:45:46,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:46,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:46,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:46,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:46,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:46,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:46,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:46,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:46,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:46,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,481 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:45:46,483 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-10-12 00:45:46,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:46,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:46,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:46,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:46,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:46,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:46,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:46,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:46,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-12 00:45:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,506 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:45:46,508 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-10-12 00:45:46,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:46,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:46,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:46,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:46,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:46,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:46,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:46,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:46,532 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-12 00:45:46,533 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:46,534 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:46,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:45:46,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:46,536 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:46,536 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:46,536 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~r~0#1) = -8*ULTIMATE.start_main_~j~0#1 + 5*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2024-10-12 00:45:46,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:45:46,553 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:46,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:46,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:46,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:46,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:45:46,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:46,820 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-10-12 00:45:46,820 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 200 transitions. cyclomatic complexity: 27 Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-12 00:45:47,045 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 200 transitions. cyclomatic complexity: 27. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 675 states and 729 transitions. Complement of second has 17 states. [2024-10-12 00:45:47,046 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-10-12 00:45:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-12 00:45:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-10-12 00:45:47,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 6 letters. Loop has 25 letters. [2024-10-12 00:45:47,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:47,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 31 letters. Loop has 25 letters. [2024-10-12 00:45:47,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:47,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 6 letters. Loop has 50 letters. [2024-10-12 00:45:47,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:47,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 675 states and 729 transitions. [2024-10-12 00:45:47,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:47,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 675 states to 510 states and 561 transitions. [2024-10-12 00:45:47,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-10-12 00:45:47,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-10-12 00:45:47,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 510 states and 561 transitions. [2024-10-12 00:45:47,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:47,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 510 states and 561 transitions. [2024-10-12 00:45:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states and 561 transitions. [2024-10-12 00:45:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 315. [2024-10-12 00:45:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 315 states have (on average 1.1142857142857143) internal successors, (351), 314 states have internal predecessors, (351), 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-10-12 00:45:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 351 transitions. [2024-10-12 00:45:47,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 315 states and 351 transitions. [2024-10-12 00:45:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:45:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:45:47,061 INFO L87 Difference]: Start difference. First operand 315 states and 351 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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-10-12 00:45:47,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:47,225 INFO L93 Difference]: Finished difference Result 554 states and 598 transitions. [2024-10-12 00:45:47,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 554 states and 598 transitions. [2024-10-12 00:45:47,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:47,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 554 states to 321 states and 357 transitions. [2024-10-12 00:45:47,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-12 00:45:47,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-12 00:45:47,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 357 transitions. [2024-10-12 00:45:47,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:47,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 321 states and 357 transitions. [2024-10-12 00:45:47,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 357 transitions. [2024-10-12 00:45:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 226. [2024-10-12 00:45:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 1.1238938053097345) internal successors, (254), 225 states have internal predecessors, (254), 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-10-12 00:45:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2024-10-12 00:45:47,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 226 states and 254 transitions. [2024-10-12 00:45:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:45:47,237 INFO L425 stractBuchiCegarLoop]: Abstraction has 226 states and 254 transitions. [2024-10-12 00:45:47,237 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:45:47,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 254 transitions. [2024-10-12 00:45:47,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:47,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:47,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:47,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:47,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:47,240 INFO L745 eck$LassoCheckResult]: Stem: 6438#$Ultimate##0 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); 6376#L-1 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; 6377#L27 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; 6361#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; 6362#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 6393#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 6487#L39 assume !(main_~j~0#1 < main_~r~0#1); 6489#L39-1 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; 6582#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 6579#L18-14 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; 6578#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 6576#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 6403#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 6367#L38-3 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; 6368#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 6388#L18-32 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; 6418#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 6486#L18-35 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; 6443#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 6426#L38-2 [2024-10-12 00:45:47,240 INFO L747 eck$LassoCheckResult]: Loop: 6426#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 6410#L39 assume main_~j~0#1 < main_~r~0#1;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; 6411#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6396#L18-2 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; 6397#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 6369#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6370#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 6382#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6383#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 6429#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 6363#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 6364#L39-1 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; 6378#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 6379#L18-14 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; 6419#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 6420#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 6402#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; 6389#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 6390#L18-20 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; 6406#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 6407#L18-23 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; 6414#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 6415#L18-26 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; 6440#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 6425#L18-29 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; 6426#L38-2 [2024-10-12 00:45:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1035079084, now seen corresponding path program 1 times [2024-10-12 00:45:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867193311] [2024-10-12 00:45:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:47,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:47,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:47,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:47,260 INFO L85 PathProgramCache]: Analyzing trace with hash -94981115, now seen corresponding path program 2 times [2024-10-12 00:45:47,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:47,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196420638] [2024-10-12 00:45:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:47,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:47,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:47,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:47,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:47,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1850199226, now seen corresponding path program 1 times [2024-10-12 00:45:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775911887] [2024-10-12 00:45:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:47,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:47,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:47,528 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:47,528 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:47,528 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:47,529 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:47,529 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:47,529 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,529 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:47,529 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:47,529 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2024-10-12 00:45:47,529 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:47,529 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:47,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,605 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:47,605 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:47,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,607 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:45:47,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:47,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:47,621 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:47,621 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-10-12 00:45:47,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-12 00:45:47,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,633 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 00:45:47,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:47,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:47,645 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:47,645 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:47,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:47,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,657 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:45:47,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:47,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:47,669 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:47,669 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-10-12 00:45:47,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:47,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,681 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 00:45:47,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:47,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:47,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-12 00:45:47,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,713 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 00:45:47,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:47,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:47,797 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:47,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-12 00:45:47,802 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:47,802 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:47,802 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:47,802 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:47,802 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:47,802 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,802 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:47,802 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:47,802 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2024-10-12 00:45:47,802 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:47,802 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:47,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:47,854 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:47,855 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,857 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:45:47,858 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-10-12 00:45:47,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:47,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:47,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:47,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:47,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:47,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:47,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:47,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:47,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-12 00:45:47,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,882 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:45:47,884 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-10-12 00:45:47,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:47,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:47,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:47,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:47,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:47,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:47,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:47,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:47,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:47,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,907 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:45:47,908 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-10-12 00:45:47,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:47,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:47,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:47,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:47,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:47,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:47,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:47,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:47,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-12 00:45:47,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,934 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:45:47,936 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-10-12 00:45:47,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:47,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:47,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:47,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:47,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:47,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:47,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:47,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:47,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-12 00:45:47,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,959 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:45:47,962 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-10-12 00:45:47,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:47,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:47,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:47,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:47,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:47,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:47,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:47,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:47,981 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-12 00:45:47,981 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:47,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:47,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:47,982 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:47,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:45:47,984 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:47,984 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:47,984 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:47,984 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~r~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-10-12 00:45:47,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:45:47,995 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:48,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:48,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:48,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:48,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:48,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:48,201 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-10-12 00:45:48,201 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-10-12 00:45:48,255 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 382 states and 418 transitions. Complement of second has 7 states. [2024-10-12 00:45:48,256 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-10-12 00:45:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-10-12 00:45:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2024-10-12 00:45:48,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 19 letters. Loop has 25 letters. [2024-10-12 00:45:48,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:48,257 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:48,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:48,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:48,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:48,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:48,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-12 00:45:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:48,488 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-12 00:45:48,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-10-12 00:45:48,668 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 462 states and 500 transitions. Complement of second has 15 states. [2024-10-12 00:45:48,669 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-10-12 00:45:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-10-12 00:45:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2024-10-12 00:45:48,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 76 transitions. Stem has 19 letters. Loop has 25 letters. [2024-10-12 00:45:48,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:48,669 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:48,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:48,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:48,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:48,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:48,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:48,877 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-10-12 00:45:48,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-10-12 00:45:48,935 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 761 states and 824 transitions. Complement of second has 7 states. [2024-10-12 00:45:48,936 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-10-12 00:45:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-10-12 00:45:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-10-12 00:45:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 19 letters. Loop has 25 letters. [2024-10-12 00:45:48,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:48,937 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:48,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:48,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:48,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:49,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:49,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:49,146 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-12 00:45:49,146 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-10-12 00:45:49,299 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 913 states and 983 transitions. Complement of second has 14 states. [2024-10-12 00:45:49,300 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-10-12 00:45:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-10-12 00:45:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-10-12 00:45:49,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 19 letters. Loop has 25 letters. [2024-10-12 00:45:49,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:49,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 44 letters. Loop has 25 letters. [2024-10-12 00:45:49,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:49,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 19 letters. Loop has 50 letters. [2024-10-12 00:45:49,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:49,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 983 transitions. [2024-10-12 00:45:49,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:49,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 632 states and 696 transitions. [2024-10-12 00:45:49,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-10-12 00:45:49,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-10-12 00:45:49,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 632 states and 696 transitions. [2024-10-12 00:45:49,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:49,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 632 states and 696 transitions. [2024-10-12 00:45:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states and 696 transitions. [2024-10-12 00:45:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 418. [2024-10-12 00:45:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 418 states have (on average 1.1172248803827751) internal successors, (467), 417 states have internal predecessors, (467), 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-10-12 00:45:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 467 transitions. [2024-10-12 00:45:49,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 418 states and 467 transitions. [2024-10-12 00:45:49,316 INFO L425 stractBuchiCegarLoop]: Abstraction has 418 states and 467 transitions. [2024-10-12 00:45:49,316 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:45:49,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 467 transitions. [2024-10-12 00:45:49,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:49,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:49,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:49,319 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:49,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:49,319 INFO L745 eck$LassoCheckResult]: Stem: 9802#$Ultimate##0 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); 9733#L-1 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; 9734#L27 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; 9717#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; 9718#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 9751#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 9964#L39 assume !(main_~j~0#1 < main_~r~0#1); 9765#L39-1 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; 10132#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 10131#L18-14 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; 10130#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 10129#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 10128#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 9719#L38-3 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; 9720#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 9842#L18-32 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; 9715#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 9716#L18-35 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; 9743#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 9813#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 9812#L39 assume main_~j~0#1 < main_~r~0#1;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; 9793#L18 assume !(0 == __VERIFIER_assert_~cond#1); 9794#L18-2 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; 9811#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 9721#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 9722#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 9808#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 9807#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 9797#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 9725#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 9726#L39-1 [2024-10-12 00:45:49,320 INFO L747 eck$LassoCheckResult]: Loop: 9726#L39-1 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; 9735#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 9736#L18-14 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; 9774#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 9775#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 9758#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; 9747#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 9748#L18-20 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; 9766#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 9767#L18-23 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; 9770#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 9771#L18-26 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; 9804#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 9787#L18-29 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; 9788#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 9809#L39 assume main_~j~0#1 < main_~r~0#1;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; 9810#L18 assume !(0 == __VERIFIER_assert_~cond#1); 9753#L18-2 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; 9754#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 9760#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 9757#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 9739#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 9740#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 9791#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 9806#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 9726#L39-1 [2024-10-12 00:45:49,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash -216057713, now seen corresponding path program 1 times [2024-10-12 00:45:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054584080] [2024-10-12 00:45:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:49,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:49,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash -289806389, now seen corresponding path program 3 times [2024-10-12 00:45:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:49,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167900784] [2024-10-12 00:45:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:49,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:49,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:49,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -46806275, now seen corresponding path program 1 times [2024-10-12 00:45:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710378188] [2024-10-12 00:45:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:49,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710378188] [2024-10-12 00:45:49,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710378188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:45:49,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889106998] [2024-10-12 00:45:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:49,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:45:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:49,512 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:45:49,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-10-12 00:45:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:49,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:45:49,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:49,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:45:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:49,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889106998] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:45:49,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:45:49,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-12 00:45:49,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899533124] [2024-10-12 00:45:49,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:45:50,088 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:50,088 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:50,088 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:50,088 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:50,088 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:50,088 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:50,088 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:50,088 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:50,088 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2024-10-12 00:45:50,088 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:50,088 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:50,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,135 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:50,135 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:50,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:50,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:50,136 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:50,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:45:50,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:50,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:50,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-12 00:45:50,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:50,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:50,168 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:50,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:45:50,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:50,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:50,245 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:50,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-12 00:45:50,249 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:50,249 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:50,249 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:50,250 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:50,250 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:50,250 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:50,250 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:50,250 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:50,250 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2024-10-12 00:45:50,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:50,250 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:50,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:50,306 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:50,306 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:50,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:50,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:50,307 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:50,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 00:45:50,309 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-10-12 00:45:50,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:50,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:50,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:50,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:50,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:50,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:50,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:50,323 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:50,330 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-12 00:45:50,330 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:50,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:50,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:50,332 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:50,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-12 00:45:50,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:50,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:50,334 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:50,334 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 2*ULTIMATE.start_main_~r~0#1 - 3*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-10-12 00:45:50,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:50,345 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:50,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:50,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:50,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:50,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 00:45:50,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:50,596 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-10-12 00:45:50,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 418 states and 467 transitions. cyclomatic complexity: 54 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-10-12 00:45:50,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:50,936 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 418 states and 467 transitions. cyclomatic complexity: 54. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 1359 states and 1478 transitions. Complement of second has 23 states. [2024-10-12 00:45:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-10-12 00:45:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-10-12 00:45:50,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 30 letters. Loop has 25 letters. [2024-10-12 00:45:50,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:50,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 55 letters. Loop has 25 letters. [2024-10-12 00:45:50,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:50,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 30 letters. Loop has 50 letters. [2024-10-12 00:45:50,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:50,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1359 states and 1478 transitions. [2024-10-12 00:45:50,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-10-12 00:45:50,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1359 states to 1171 states and 1286 transitions. [2024-10-12 00:45:50,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2024-10-12 00:45:50,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2024-10-12 00:45:50,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1171 states and 1286 transitions. [2024-10-12 00:45:50,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:50,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1171 states and 1286 transitions. [2024-10-12 00:45:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states and 1286 transitions. [2024-10-12 00:45:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 862. [2024-10-12 00:45:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 862 states have (on average 1.1078886310904872) internal successors, (955), 861 states have internal predecessors, (955), 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-10-12 00:45:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 955 transitions. [2024-10-12 00:45:50,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 862 states and 955 transitions. [2024-10-12 00:45:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:50,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:45:50,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:45:50,967 INFO L87 Difference]: Start difference. First operand 862 states and 955 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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-10-12 00:45:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:52,018 INFO L93 Difference]: Finished difference Result 4166 states and 4470 transitions. [2024-10-12 00:45:52,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4166 states and 4470 transitions. [2024-10-12 00:45:52,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 114 [2024-10-12 00:45:52,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4166 states to 2898 states and 3126 transitions. [2024-10-12 00:45:52,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 276 [2024-10-12 00:45:52,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2024-10-12 00:45:52,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2898 states and 3126 transitions. [2024-10-12 00:45:52,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:52,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2898 states and 3126 transitions. [2024-10-12 00:45:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states and 3126 transitions. [2024-10-12 00:45:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1303. [2024-10-12 00:45:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1303 states have (on average 1.1028396009209516) internal successors, (1437), 1302 states have internal predecessors, (1437), 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-10-12 00:45:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1437 transitions. [2024-10-12 00:45:52,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1303 states and 1437 transitions. [2024-10-12 00:45:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-12 00:45:52,078 INFO L425 stractBuchiCegarLoop]: Abstraction has 1303 states and 1437 transitions. [2024-10-12 00:45:52,078 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:45:52,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1303 states and 1437 transitions. [2024-10-12 00:45:52,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-10-12 00:45:52,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:52,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:52,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:52,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:52,085 INFO L745 eck$LassoCheckResult]: Stem: 17239#$Ultimate##0 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); 17169#L-1 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; 17170#L27 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; 17155#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; 17156#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 17189#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 17564#L39 assume main_~j~0#1 < main_~r~0#1;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; 18080#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18079#L18-2 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; 18078#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 18077#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18076#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 18075#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18074#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 18073#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 18064#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 18062#L39-1 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; 18061#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 18060#L18-14 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; 18059#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 18058#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 18036#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 17810#L38-3 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; 17808#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 17806#L18-32 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; 17804#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 17435#L18-35 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; 17245#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 17247#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 17412#L39 assume main_~j~0#1 < main_~r~0#1;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; 17235#L18 assume !(0 == __VERIFIER_assert_~cond#1); 17192#L18-2 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; 17193#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 17163#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 17164#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 17176#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 17177#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 17229#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 17159#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 17160#L39-1 [2024-10-12 00:45:52,085 INFO L747 eck$LassoCheckResult]: Loop: 17160#L39-1 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; 17172#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 17173#L18-14 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; 17214#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 17215#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 17196#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; 17197#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 17399#L18-20 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; 17398#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 17397#L18-23 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; 17204#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 17205#L18-26 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; 17240#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 17395#L18-29 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; 17394#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 17393#L39 assume main_~j~0#1 < main_~r~0#1;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; 17392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 17391#L18-2 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; 17390#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 17389#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 17388#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 17387#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 17386#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 17385#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 17384#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 17160#L39-1 [2024-10-12 00:45:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash 247002273, now seen corresponding path program 1 times [2024-10-12 00:45:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048768580] [2024-10-12 00:45:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:52,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,110 INFO L85 PathProgramCache]: Analyzing trace with hash -289806389, now seen corresponding path program 4 times [2024-10-12 00:45:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527484497] [2024-10-12 00:45:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:52,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1441831125, now seen corresponding path program 1 times [2024-10-12 00:45:52,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779277567] [2024-10-12 00:45:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:52,331 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:52,332 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:52,332 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:52,332 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:52,332 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:52,332 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:52,332 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:52,332 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2024-10-12 00:45:52,332 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:52,332 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:52,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,383 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:52,383 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:52,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,387 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 00:45:52,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:52,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:52,400 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:52,400 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-10-12 00:45:52,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-12 00:45:52,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,411 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 00:45:52,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:52,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:52,424 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:52,424 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:52,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-12 00:45:52,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,435 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 00:45:52,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:52,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:52,447 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:52,447 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-10-12 00:45:52,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-12 00:45:52,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,459 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 00:45:52,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:52,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:52,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-12 00:45:52,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,489 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-12 00:45:52,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:52,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:52,565 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:52,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-12 00:45:52,570 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:52,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:52,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:52,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:52,570 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:52,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:52,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:52,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2024-10-12 00:45:52,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:52,570 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:52,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:52,615 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:52,615 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:52,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,617 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-12 00:45:52,618 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-10-12 00:45:52,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:52,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:52,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:52,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:52,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:52,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:52,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:52,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:52,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-12 00:45:52,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,641 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-12 00:45:52,643 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-10-12 00:45:52,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:52,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:52,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:52,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:52,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:52,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:52,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:52,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:52,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-10-12 00:45:52,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,667 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-12 00:45:52,668 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-10-12 00:45:52,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:52,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:52,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:52,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:52,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:52,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:52,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:52,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:52,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-12 00:45:52,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,691 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-12 00:45:52,692 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-10-12 00:45:52,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:52,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:52,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:52,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:52,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:52,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:52,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:52,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:52,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-10-12 00:45:52,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,715 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-12 00:45:52,716 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-10-12 00:45:52,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:52,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:52,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:52,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:52,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:52,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:52,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:52,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:52,732 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-12 00:45:52,733 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:52,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,734 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-12 00:45:52,735 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:52,735 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:52,735 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:52,735 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~r~0#1) = -3*ULTIMATE.start_main_~j~0#1 + 2*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2024-10-12 00:45:52,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-12 00:45:52,746 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:52,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:52,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:52,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:52,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:52,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:52,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-10-12 00:45:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:52,989 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-10-12 00:45:52,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-10-12 00:45:53,299 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 2334 states and 2516 transitions. Complement of second has 21 states. [2024-10-12 00:45:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-10-12 00:45:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-10-12 00:45:53,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 164 transitions. Stem has 39 letters. Loop has 25 letters. [2024-10-12 00:45:53,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:53,301 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:53,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:53,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:53,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:53,542 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-12 00:45:53,542 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-10-12 00:45:53,851 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 2333 states and 2516 transitions. Complement of second has 21 states. [2024-10-12 00:45:53,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-10-12 00:45:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-10-12 00:45:53,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 164 transitions. Stem has 39 letters. Loop has 25 letters. [2024-10-12 00:45:53,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:53,853 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:53,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:53,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:53,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:54,045 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-10-12 00:45:54,045 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-10-12 00:45:54,347 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 2892 states and 3102 transitions. Complement of second has 30 states. [2024-10-12 00:45:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-10-12 00:45:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2024-10-12 00:45:54,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 165 transitions. Stem has 39 letters. Loop has 25 letters. [2024-10-12 00:45:54,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 165 transitions. Stem has 64 letters. Loop has 25 letters. [2024-10-12 00:45:54,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 165 transitions. Stem has 39 letters. Loop has 50 letters. [2024-10-12 00:45:54,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2892 states and 3102 transitions. [2024-10-12 00:45:54,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-10-12 00:45:54,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2892 states to 1957 states and 2133 transitions. [2024-10-12 00:45:54,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2024-10-12 00:45:54,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2024-10-12 00:45:54,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1957 states and 2133 transitions. [2024-10-12 00:45:54,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:54,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1957 states and 2133 transitions. [2024-10-12 00:45:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states and 2133 transitions. [2024-10-12 00:45:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 741. [2024-10-12 00:45:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 741 states have (on average 1.0998650472334683) internal successors, (815), 740 states have internal predecessors, (815), 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-10-12 00:45:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 815 transitions. [2024-10-12 00:45:54,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 741 states and 815 transitions. [2024-10-12 00:45:54,401 INFO L425 stractBuchiCegarLoop]: Abstraction has 741 states and 815 transitions. [2024-10-12 00:45:54,401 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:45:54,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 741 states and 815 transitions. [2024-10-12 00:45:54,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:45:54,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:54,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:54,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:54,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:54,406 INFO L745 eck$LassoCheckResult]: Stem: 26807#$Ultimate##0 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); 26740#L-1 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; 26741#L27 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; 26725#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; 26726#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 26761#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 27186#L39 assume main_~j~0#1 < main_~r~0#1;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; 27386#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27384#L18-2 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; 27382#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 27380#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27378#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 27376#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27374#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 27372#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 27370#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 27308#L39-1 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; 27463#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 27462#L18-14 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; 27461#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 27460#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 26881#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 26879#L38-3 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; 26877#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 26875#L18-32 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; 26872#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 26871#L18-35 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; 26845#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 26841#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 26840#L39 assume main_~j~0#1 < main_~r~0#1;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; 26839#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26838#L18-2 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; 26837#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 26729#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26730#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 26763#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26797#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 26798#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 26733#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 26734#L39-1 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; 26742#L18-12 [2024-10-12 00:45:54,407 INFO L747 eck$LassoCheckResult]: Loop: 26742#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 26743#L18-14 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; 26781#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 26782#L18-17 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1; 26765#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; 26753#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 26754#L18-20 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; 26773#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 26774#L18-23 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; 26777#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 26778#L18-26 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; 26808#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 26793#L18-29 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; 26794#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 26769#L39 assume main_~j~0#1 < main_~r~0#1;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; 26770#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26757#L18-2 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; 26758#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 26768#L18-5 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 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26836#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 26746#L18-8 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 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26747#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 26802#L18-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1; 26803#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 26785#L39-1 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; 26742#L18-12 [2024-10-12 00:45:54,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1073412628, now seen corresponding path program 1 times [2024-10-12 00:45:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:54,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662947912] [2024-10-12 00:45:54,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:54,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:54,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash -472888785, now seen corresponding path program 1 times [2024-10-12 00:45:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:54,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907703883] [2024-10-12 00:45:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:54,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1266011484, now seen corresponding path program 2 times [2024-10-12 00:45:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:54,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421165135] [2024-10-12 00:45:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:54,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:54,700 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:54,700 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:54,700 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:54,700 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:54,700 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:54,700 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,700 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:54,700 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:54,700 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration12_Loop [2024-10-12 00:45:54,700 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:54,700 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:54,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,762 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:54,763 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:54,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,764 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-10-12 00:45:54,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:54,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,776 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:54,776 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:54,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-10-12 00:45:54,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,788 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-12 00:45:54,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:54,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,800 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:54,801 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-10-12 00:45:54,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-10-12 00:45:54,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,812 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-12 00:45:54,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:54,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,824 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:54,824 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-10-12 00:45:54,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-12 00:45:54,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,836 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-12 00:45:54,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:54,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,856 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:54,856 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:54,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-12 00:45:54,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,867 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-12 00:45:54,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:54,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-10-12 00:45:54,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,906 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-12 00:45:54,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:54,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,987 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:54,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-10-12 00:45:54,991 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:54,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:54,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:54,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:54,992 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:54,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:54,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:54,992 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration12_Loop [2024-10-12 00:45:54,992 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:54,992 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:54,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,051 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:55,051 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:55,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,052 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-12 00:45:55,054 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-10-12 00:45:55,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-10-12 00:45:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,076 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-12 00:45:55,078 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-10-12 00:45:55,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-10-12 00:45:55,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,100 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-12 00:45:55,102 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-10-12 00:45:55,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-10-12 00:45:55,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,125 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-12 00:45:55,127 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-10-12 00:45:55,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,138 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:45:55,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,138 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:45:55,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-10-12 00:45:55,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,152 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-12 00:45:55,153 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-10-12 00:45:55,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:55,171 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:45:55,171 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-10-12 00:45:55,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,172 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-12 00:45:55,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:55,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:55,173 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:55,173 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~r~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-10-12 00:45:55,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-10-12 00:45:55,184 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:55,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:55,392 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-10-12 00:45:55,392 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80 Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-10-12 00:45:55,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 1070 states and 1159 transitions. Complement of second has 13 states. [2024-10-12 00:45:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-10-12 00:45:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2024-10-12 00:45:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 57 transitions. Stem has 40 letters. Loop has 25 letters. [2024-10-12 00:45:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:55,511 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:55,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-10-12 00:45:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:55,739 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-12 00:45:55,739 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80 Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-10-12 00:45:55,848 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 1072 states and 1161 transitions. Complement of second has 13 states. [2024-10-12 00:45:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-10-12 00:45:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2024-10-12 00:45:55,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 40 letters. Loop has 25 letters. [2024-10-12 00:45:55,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:55,849 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:55,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:56,049 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 4 loop predicates [2024-10-12 00:45:56,049 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80 Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-10-12 00:45:56,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 1652 states and 1787 transitions. Complement of second has 15 states. [2024-10-12 00:45:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-10-12 00:45:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-10-12 00:45:56,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 40 letters. Loop has 25 letters. [2024-10-12 00:45:56,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 65 letters. Loop has 25 letters. [2024-10-12 00:45:56,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 40 letters. Loop has 50 letters. [2024-10-12 00:45:56,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1652 states and 1787 transitions. [2024-10-12 00:45:56,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:45:56,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1652 states to 0 states and 0 transitions. [2024-10-12 00:45:56,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:45:56,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:45:56,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:45:56,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:56,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:45:56,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:45:56,185 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:45:56,185 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:45:56,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:45:56,186 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:45:56,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:45:56,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:45:56 BoogieIcfgContainer [2024-10-12 00:45:56,193 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:45:56,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:45:56,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:45:56,194 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:45:56,194 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:39" (3/4) ... [2024-10-12 00:45:56,196 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:45:56,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:45:56,198 INFO L158 Benchmark]: Toolchain (without parser) took 17835.15ms. Allocated memory was 195.0MB in the beginning and 295.7MB in the end (delta: 100.7MB). Free memory was 124.8MB in the beginning and 180.5MB in the end (delta: -55.7MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,198 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:45:56,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.65ms. Allocated memory is still 195.0MB. Free memory was 124.4MB in the beginning and 112.2MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.16ms. Allocated memory is still 195.0MB. Free memory was 112.2MB in the beginning and 110.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,198 INFO L158 Benchmark]: Boogie Preprocessor took 45.89ms. Allocated memory is still 195.0MB. Free memory was 110.2MB in the beginning and 107.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,199 INFO L158 Benchmark]: RCFGBuilder took 480.42ms. Allocated memory is still 195.0MB. Free memory was 107.6MB in the beginning and 90.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,199 INFO L158 Benchmark]: BuchiAutomizer took 17027.53ms. Allocated memory was 195.0MB in the beginning and 295.7MB in the end (delta: 100.7MB). Free memory was 90.9MB in the beginning and 181.5MB in the end (delta: -90.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,199 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 295.7MB. Free memory was 181.5MB in the beginning and 180.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:45:56,200 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.16ms. Allocated memory is still 125.8MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.65ms. Allocated memory is still 195.0MB. Free memory was 124.4MB in the beginning and 112.2MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.16ms. Allocated memory is still 195.0MB. Free memory was 112.2MB in the beginning and 110.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.89ms. Allocated memory is still 195.0MB. Free memory was 110.2MB in the beginning and 107.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 480.42ms. Allocated memory is still 195.0MB. Free memory was 107.6MB in the beginning and 90.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 17027.53ms. Allocated memory was 195.0MB in the beginning and 295.7MB in the end (delta: 100.7MB). Free memory was 90.9MB in the beginning and 181.5MB in the end (delta: -90.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 295.7MB. Free memory was 181.5MB in the beginning and 180.5MB in the end (delta: 1.0MB). 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 18 terminating modules (8 trivial, 7 deterministic, 3 nondeterministic). One deterministic module has affine ranking function l and consists of 5 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function j and consists of 9 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function (((long long) 5 * r) + ((long long) -8 * j)) and consists of 9 locations. One deterministic module has affine ranking function (((long long) -3 * j) + ((long long) 2 * r)) and consists of 12 locations. One nondeterministic module has affine ranking function (((long long) -1 * j) + r) and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -3 * j) + ((long long) 2 * r)) and consists of 11 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + r) and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.9s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 8.7s. Construction of modules took 2.1s. Büchi inclusion checks took 5.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 4588 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3097 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3080 mSDsluCounter, 4168 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2590 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3027 IncrementalHoareTripleChecker+Invalid, 3235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 1578 mSDtfsCounter, 3027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT4 conc0 concLT6 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf100 lsp98 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:45:56,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2024-10-12 00:45:56,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:56,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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