./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ffc745103ed55cbf924659873c1ffa566d33874f07e41d755dd0e85e8b4a5c0d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:16:09,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:16:09,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-20 22:16:09,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:16:09,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:16:09,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:16:09,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:16:09,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:16:09,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:16:09,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:16:09,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:16:09,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:16:09,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:16:09,632 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:16:09,632 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:16:09,632 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:16:09,632 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:16:09,632 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:16:09,633 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:16:09,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:16:09,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:16:09,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:16:09,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:16:09,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:16:09,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:16:09,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:16:09,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:16:09,637 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:16:09,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:16:09,638 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:16:09,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:16:09,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:16:09,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:16:09,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:16:09,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:16:09,639 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:16:09,639 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffc745103ed55cbf924659873c1ffa566d33874f07e41d755dd0e85e8b4a5c0d [2024-11-20 22:16:09,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:16:09,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:16:09,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:16:09,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:16:09,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:16:09,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2024-11-20 22:16:10,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:16:11,169 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:16:11,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2024-11-20 22:16:11,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4561922/b1ded58bcb7840a5b35ec73ea9692512/FLAG32f2226c5 [2024-11-20 22:16:11,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4561922/b1ded58bcb7840a5b35ec73ea9692512 [2024-11-20 22:16:11,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:16:11,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:16:11,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:16:11,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:16:11,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:16:11,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a93f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11, skipping insertion in model container [2024-11-20 22:16:11,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:16:11,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:16:11,799 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:16:11,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:16:11,852 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:16:11,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11 WrapperNode [2024-11-20 22:16:11,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:16:11,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:16:11,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:16:11,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:16:11,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,880 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2024-11-20 22:16:11,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:16:11,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:16:11,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:16:11,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:16:11,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,898 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-20 22:16:11,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:16:11,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:16:11,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:16:11,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:16:11,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (1/1) ... [2024-11-20 22:16:11,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:11,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:11,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:16:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:16:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:16:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:16:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:16:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:16:11,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:16:12,051 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:16:12,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:16:12,119 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 22:16:12,119 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:16:12,131 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:16:12,132 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 22:16:12,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:16:12 BoogieIcfgContainer [2024-11-20 22:16:12,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:16:12,133 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:16:12,133 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:16:12,135 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:16:12,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:16:12,136 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:16:11" (1/3) ... [2024-11-20 22:16:12,137 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ec23c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:16:12, skipping insertion in model container [2024-11-20 22:16:12,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:16:12,137 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:11" (2/3) ... [2024-11-20 22:16:12,137 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ec23c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:16:12, skipping insertion in model container [2024-11-20 22:16:12,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:16:12,138 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:16:12" (3/3) ... [2024-11-20 22:16:12,138 INFO L332 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2024-11-20 22:16:12,173 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:16:12,173 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:16:12,174 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:16:12,174 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:16:12,174 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:16:12,174 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:16:12,174 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:16:12,174 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:16:12,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-11-20 22:16:12,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-20 22:16:12,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:16:12,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:16:12,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:16:12,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:16:12,195 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:16:12,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-11-20 22:16:12,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-20 22:16:12,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:16:12,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:16:12,196 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:16:12,196 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:16:12,202 INFO L745 eck$LassoCheckResult]: Stem: 11#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 8#L566true assume !(main_~array_size~0#1 < 1); 12#L566-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 5#L550-3true [2024-11-20 22:16:12,202 INFO L747 eck$LassoCheckResult]: Loop: 5#L550-3true assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 13#L554-3true assume !true; 7#L554-4true call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 14#L550-2true SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 5#L550-3true [2024-11-20 22:16:12,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-20 22:16:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:12,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463377622] [2024-11-20 22:16:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:12,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2024-11-20 22:16:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553239178] [2024-11-20 22:16:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:16:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553239178] [2024-11-20 22:16:12,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553239178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:16:12,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:16:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 22:16:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317106033] [2024-11-20 22:16:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:16:12,364 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:16:12,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:16:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 22:16:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 22:16:12,388 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:16:12,392 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2024-11-20 22:16:12,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2024-11-20 22:16:12,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-20 22:16:12,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2024-11-20 22:16:12,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:16:12,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:16:12,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2024-11-20 22:16:12,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:16:12,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-20 22:16:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2024-11-20 22:16:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-20 22:16:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-11-20 22:16:12,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-20 22:16:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 22:16:12,417 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-20 22:16:12,417 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:16:12,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2024-11-20 22:16:12,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-20 22:16:12,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:16:12,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:16:12,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:16:12,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:16:12,419 INFO L745 eck$LassoCheckResult]: Stem: 39#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 44#L566 assume !(main_~array_size~0#1 < 1); 41#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 42#L550-3 [2024-11-20 22:16:12,419 INFO L747 eck$LassoCheckResult]: Loop: 42#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 38#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 43#L554-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 45#L550-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 42#L550-3 [2024-11-20 22:16:12,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2024-11-20 22:16:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:12,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131959535] [2024-11-20 22:16:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:12,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:12,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2024-11-20 22:16:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553920623] [2024-11-20 22:16:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:16:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553920623] [2024-11-20 22:16:12,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553920623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:16:12,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:16:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 22:16:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113075435] [2024-11-20 22:16:12,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:16:12,519 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:16:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:16:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:16:12,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:16:12,519 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:16:12,561 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2024-11-20 22:16:12,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2024-11-20 22:16:12,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-20 22:16:12,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2024-11-20 22:16:12,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-20 22:16:12,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-20 22:16:12,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-11-20 22:16:12,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:16:12,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-20 22:16:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-11-20 22:16:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-20 22:16:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-20 22:16:12,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-20 22:16:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:16:12,565 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-20 22:16:12,565 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:16:12,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-11-20 22:16:12,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-20 22:16:12,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:16:12,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:16:12,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:16:12,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:16:12,567 INFO L745 eck$LassoCheckResult]: Stem: 66#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 67#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 71#L566 assume !(main_~array_size~0#1 < 1); 68#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 69#L550-3 [2024-11-20 22:16:12,567 INFO L747 eck$LassoCheckResult]: Loop: 69#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 70#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 63#L556 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 64#L554-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 65#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 72#L554-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 73#L550-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 69#L550-3 [2024-11-20 22:16:12,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2024-11-20 22:16:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549083868] [2024-11-20 22:16:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:12,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2024-11-20 22:16:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:12,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465707035] [2024-11-20 22:16:12,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:12,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2024-11-20 22:16:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817152055] [2024-11-20 22:16:12,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:12,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:12,975 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:16:12,975 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:16:12,976 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:16:12,976 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:16:12,976 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:16:12,976 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:12,976 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:16:12,976 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:16:12,976 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2024-11-20 22:16:12,976 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:16:12,976 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:16:12,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:12,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,401 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:16:13,404 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:16:13,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:13,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:13,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:13,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-20 22:16:13,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:13,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:13,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:13,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:13,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:13,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:13,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:13,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:13,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:13,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-20 22:16:13,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:13,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:13,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-20 22:16:13,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:13,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:13,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:13,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:13,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:13,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:13,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:13,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:16:13,505 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-20 22:16:13,505 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-20 22:16:13,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:13,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:13,534 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:13,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-20 22:16:13,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:16:13,553 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:16:13,553 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:16:13,553 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size#1, ULTIMATE.start_SelectionSort_~i~0#1) = 1*ULTIMATE.start_SelectionSort_~array_size#1 - 1*ULTIMATE.start_SelectionSort_~i~0#1 Supporting invariants [] [2024-11-20 22:16:13,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:13,570 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-20 22:16:13,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:13,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:16:13,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:13,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:16:13,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 22:16:13,668 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:16:13,672 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 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-11-20 22:16:13,700 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. 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) Result 18 states and 24 transitions. Complement of second has 4 states. [2024-11-20 22:16:13,701 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-11-20 22:16:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. 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-11-20 22:16:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-20 22:16:13,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 7 letters. [2024-11-20 22:16:13,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:13,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 7 letters. [2024-11-20 22:16:13,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:13,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 14 letters. [2024-11-20 22:16:13,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:13,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2024-11-20 22:16:13,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:16:13,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2024-11-20 22:16:13,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-20 22:16:13,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-20 22:16:13,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2024-11-20 22:16:13,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:16:13,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-20 22:16:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2024-11-20 22:16:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-20 22:16:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2024-11-20 22:16:13,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-20 22:16:13,707 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-20 22:16:13,708 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:16:13,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2024-11-20 22:16:13,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:16:13,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:16:13,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:16:13,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-20 22:16:13,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:16:13,709 INFO L745 eck$LassoCheckResult]: Stem: 166#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 172#L566 assume !(main_~array_size~0#1 < 1); 168#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 169#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 164#L554-3 [2024-11-20 22:16:13,709 INFO L747 eck$LassoCheckResult]: Loop: 164#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 160#L556 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 161#L554-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 164#L554-3 [2024-11-20 22:16:13,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2024-11-20 22:16:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:13,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072583336] [2024-11-20 22:16:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:13,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:13,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:13,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2024-11-20 22:16:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887034860] [2024-11-20 22:16:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:13,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:13,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2024-11-20 22:16:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431200045] [2024-11-20 22:16:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:13,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:13,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-20 22:16:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:13,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:13,974 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:16:13,974 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:16:13,974 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:16:13,974 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:16:13,974 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:16:13,974 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:13,974 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:16:13,975 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:16:13,975 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2024-11-20 22:16:13,975 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:16:13,975 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:16:13,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:13,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:14,319 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:16:14,319 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:16:14,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,322 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-20 22:16:14,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:14,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:14,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:14,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:14,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-20 22:16:14,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:14,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:14,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-20 22:16:14,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-20 22:16:14,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:14,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:14,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:14,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-20 22:16:14,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,389 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-20 22:16:14,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:14,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:14,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:14,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-20 22:16:14,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-20 22:16:14,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-11-20 22:16:14,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:14,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:14,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:14,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:14,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-20 22:16:14,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:14,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:14,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:14,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:14,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-20 22:16:14,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:14,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:14,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:14,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:14,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,483 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-20 22:16:14,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:14,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:14,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-20 22:16:14,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,508 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-20 22:16:14,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:14,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:14,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:14,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-20 22:16:14,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,529 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-20 22:16:14,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:14,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:14,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-20 22:16:14,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,554 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-20 22:16:14,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:14,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:14,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:14,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-20 22:16:14,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,578 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-20 22:16:14,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:14,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:14,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:14,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:14,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:14,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:14,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:14,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:16:14,631 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-11-20 22:16:14,632 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-20 22:16:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,634 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-20 22:16:14,635 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:16:14,646 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:16:14,647 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:16:14,647 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0#1, ULTIMATE.start_SelectionSort_~a#1.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a#1.base)_2) = -4*ULTIMATE.start_SelectionSort_~j~0#1 - 1*ULTIMATE.start_SelectionSort_~a#1.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a#1.base)_2 Supporting invariants [] [2024-11-20 22:16:14,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:14,661 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-20 22:16:14,663 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2024-11-20 22:16:14,663 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:16:14,663 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:16:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:14,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:16:14,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:14,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:16:14,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:14,706 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:16:14,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:14,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 40 transitions. Complement of second has 5 states. [2024-11-20 22:16:14,721 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-11-20 22:16:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-20 22:16:14,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-20 22:16:14,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:14,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2024-11-20 22:16:14,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:14,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2024-11-20 22:16:14,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:14,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 40 transitions. [2024-11-20 22:16:14,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:16:14,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 26 transitions. [2024-11-20 22:16:14,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-20 22:16:14,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-20 22:16:14,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2024-11-20 22:16:14,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:16:14,723 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-20 22:16:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2024-11-20 22:16:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2024-11-20 22:16:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-11-20 22:16:14,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-20 22:16:14,724 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-20 22:16:14,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:16:14,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-11-20 22:16:14,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:16:14,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:16:14,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:16:14,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:16:14,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:16:14,725 INFO L745 eck$LassoCheckResult]: Stem: 269#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 274#L566 assume !(main_~array_size~0#1 < 1); 271#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 272#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 268#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 264#L556 assume !(SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1);havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1; 265#L554-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 267#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 275#L554-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 276#L550-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 273#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 266#L554-3 [2024-11-20 22:16:14,725 INFO L747 eck$LassoCheckResult]: Loop: 266#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 262#L556 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 263#L554-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 266#L554-3 [2024-11-20 22:16:14,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2024-11-20 22:16:14,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:14,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922000558] [2024-11-20 22:16:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:14,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:16:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922000558] [2024-11-20 22:16:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922000558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:16:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369227460] [2024-11-20 22:16:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:14,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:16:14,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:14,787 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:16:14,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-20 22:16:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:14,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 22:16:14,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:14,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:16:14,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-20 22:16:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:14,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369227460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:16:14,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:16:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-20 22:16:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584959023] [2024-11-20 22:16:14,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:16:14,903 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:16:14,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:14,904 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2024-11-20 22:16:14,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:14,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509198944] [2024-11-20 22:16:14,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:14,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:14,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:14,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:16:14,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:16:14,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 22:16:14,971 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:16:14,997 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-11-20 22:16:14,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2024-11-20 22:16:14,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:16:14,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2024-11-20 22:16:14,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-20 22:16:14,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-20 22:16:14,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2024-11-20 22:16:14,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:16:14,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-20 22:16:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2024-11-20 22:16:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2024-11-20 22:16:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-20 22:16:15,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-20 22:16:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:16:15,000 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-20 22:16:15,001 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:16:15,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-11-20 22:16:15,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:16:15,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:16:15,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:16:15,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:16:15,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:16:15,002 INFO L745 eck$LassoCheckResult]: Stem: 388#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 389#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 394#L566 assume !(main_~array_size~0#1 < 1); 390#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 391#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 392#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 398#L556 assume !(SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1);havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1; 386#L554-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 387#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 383#L556 assume !(SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1);havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1; 384#L554-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 397#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 395#L554-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 396#L550-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 393#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 385#L554-3 [2024-11-20 22:16:15,002 INFO L747 eck$LassoCheckResult]: Loop: 385#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 381#L556 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 382#L554-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 385#L554-3 [2024-11-20 22:16:15,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2024-11-20 22:16:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132381374] [2024-11-20 22:16:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:15,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:15,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:15,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2024-11-20 22:16:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306121979] [2024-11-20 22:16:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:15,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:15,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2024-11-20 22:16:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:16:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183107439] [2024-11-20 22:16:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:16:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:16:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:15,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:16:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:16:15,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:16:15,344 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:16:15,344 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:16:15,344 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:16:15,344 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:16:15,344 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:16:15,344 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,344 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:16:15,344 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:16:15,344 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2024-11-20 22:16:15,344 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:16:15,344 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:16:15,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:16:15,672 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:16:15,672 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:16:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,674 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:16:15,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:15,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:15,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:15,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-20 22:16:15,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,698 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-20 22:16:15,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:15,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:15,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:15,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:15,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,725 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-20 22:16:15,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:15,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:15,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:15,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-20 22:16:15,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,747 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-20 22:16:15,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:15,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:15,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:15,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,775 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-20 22:16:15,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:15,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:15,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:15,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:15,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,797 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-20 22:16:15,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:15,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:15,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:15,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,823 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-20 22:16:15,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:15,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:15,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:15,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,846 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-20 22:16:15,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:15,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:15,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:15,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,876 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-20 22:16:15,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:15,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:15,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:15,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,903 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-20 22:16:15,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:16:15,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:16:15,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:16:15,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:16:15,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:15,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,923 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-20 22:16:15,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:16:15,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:16:15,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:16:15,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:16:15,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:16:15,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:16:15,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:16:15,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:16:15,979 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-11-20 22:16:15,979 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-20 22:16:15,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:16:15,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:16:15,981 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:16:15,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-20 22:16:15,983 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:16:15,995 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:16:15,995 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:16:15,995 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3, ULTIMATE.start_SelectionSort_~a#1.offset) = -4*ULTIMATE.start_SelectionSort_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3 - 1*ULTIMATE.start_SelectionSort_~a#1.offset Supporting invariants [] [2024-11-20 22:16:16,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:16,014 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-20 22:16:16,016 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2024-11-20 22:16:16,017 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:16:16,017 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:16:16,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:16,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:16:16,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:16,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:16:16,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:16,111 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-20 22:16:16,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:16,145 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 29 states and 41 transitions. Complement of second has 6 states. [2024-11-20 22:16:16,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:16:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-20 22:16:16,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-20 22:16:16,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:16,147 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:16:16,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:16,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:16:16,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:16,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:16:16,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:16,233 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-20 22:16:16,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:16,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 29 states and 41 transitions. Complement of second has 6 states. [2024-11-20 22:16:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:16:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-20 22:16:16,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-20 22:16:16,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:16,267 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:16:16,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:16:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:16,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:16:16,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:16:16,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:16:16,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:16:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:16:16,352 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-20 22:16:16,352 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:16,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 25 states and 36 transitions. Complement of second has 5 states. [2024-11-20 22:16:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:16:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:16:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-20 22:16:16,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-20 22:16:16,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:16,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 18 letters. Loop has 3 letters. [2024-11-20 22:16:16,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:16,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-20 22:16:16,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:16:16,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2024-11-20 22:16:16,384 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:16:16,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2024-11-20 22:16:16,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-20 22:16:16,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-20 22:16:16,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-20 22:16:16,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:16:16,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:16:16,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:16:16,385 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:16:16,385 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:16:16,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-20 22:16:16,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:16:16,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-20 22:16:16,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:16:16 BoogieIcfgContainer [2024-11-20 22:16:16,390 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-20 22:16:16,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 22:16:16,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 22:16:16,391 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 22:16:16,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:16:12" (3/4) ... [2024-11-20 22:16:16,393 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 22:16:16,394 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 22:16:16,394 INFO L158 Benchmark]: Toolchain (without parser) took 4856.96ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 176.9MB in the beginning and 128.3MB in the end (delta: 48.6MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2024-11-20 22:16:16,394 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 144.7MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:16:16,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.77ms. Allocated memory is still 207.6MB. Free memory was 176.9MB in the beginning and 159.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 22:16:16,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.83ms. Allocated memory is still 207.6MB. Free memory was 159.0MB in the beginning and 156.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:16:16,395 INFO L158 Benchmark]: Boogie Preprocessor took 29.23ms. Allocated memory is still 207.6MB. Free memory was 156.9MB in the beginning and 154.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:16:16,395 INFO L158 Benchmark]: RCFGBuilder took 220.91ms. Allocated memory is still 207.6MB. Free memory was 154.8MB in the beginning and 142.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 22:16:16,395 INFO L158 Benchmark]: BuchiAutomizer took 4257.73ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 142.3MB in the beginning and 129.3MB in the end (delta: 12.9MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-11-20 22:16:16,395 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 249.6MB. Free memory was 129.3MB in the beginning and 128.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:16:16,396 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.39ms. Allocated memory is still 144.7MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.77ms. Allocated memory is still 207.6MB. Free memory was 176.9MB in the beginning and 159.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.83ms. Allocated memory is still 207.6MB. Free memory was 159.0MB in the beginning and 156.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.23ms. Allocated memory is still 207.6MB. Free memory was 156.9MB in the beginning and 154.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 220.91ms. Allocated memory is still 207.6MB. Free memory was 154.8MB in the beginning and 142.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4257.73ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 142.3MB in the beginning and 129.3MB in the end (delta: 12.9MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 249.6MB. Free memory was 129.3MB in the beginning and 128.3MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (array_size + ((long) -1 * i)) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 3 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 75 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax112 hnf100 lsp87 ukn75 mio100 lsp59 div139 bol100 ite100 ukn100 eq155 hnf92 smp84 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 118ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-20 22:16:16,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:16,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-20 22:16:16,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE