./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/eureka_05.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:16:37,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:16:37,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:16:37,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:16:37,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:16:37,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:16:37,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:16:37,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:16:37,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:16:37,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:16:37,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:16:37,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:16:37,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:16:37,747 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:16:37,747 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:16:37,747 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:16:37,747 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:16:37,747 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:16:37,747 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:16:37,747 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:16:37,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:16:37,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:16:37,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:16:37,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:16:37,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:16:37,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:16:37,749 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:16:37,749 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2025-03-09 07:16:37,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:16:37,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:16:37,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:16:37,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:16:37,995 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:16:37,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_05.i [2025-03-09 07:16:39,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8daf37275/2bfa938170ab427689d295823bfc9efd/FLAG45e0b52d3 [2025-03-09 07:16:39,440 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:16:39,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2025-03-09 07:16:39,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8daf37275/2bfa938170ab427689d295823bfc9efd/FLAG45e0b52d3 [2025-03-09 07:16:39,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8daf37275/2bfa938170ab427689d295823bfc9efd [2025-03-09 07:16:39,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:16:39,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:16:39,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:16:39,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:16:39,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:16:39,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbdc19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39, skipping insertion in model container [2025-03-09 07:16:39,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:16:39,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:16:39,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:16:39,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:16:39,646 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:16:39,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39 WrapperNode [2025-03-09 07:16:39,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:16:39,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:16:39,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:16:39,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:16:39,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,677 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2025-03-09 07:16:39,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:16:39,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:16:39,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:16:39,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:16:39,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,697 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-09 07:16:39,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:16:39,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:16:39,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:16:39,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:16:39,716 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (1/1) ... [2025-03-09 07:16:39,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:39,747 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) [2025-03-09 07:16:39,753 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 [2025-03-09 07:16:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:16:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:16:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 07:16:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 07:16:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 07:16:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 07:16:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 07:16:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 07:16:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:16:39,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:16:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 07:16:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 07:16:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 07:16:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 07:16:39,837 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:16:39,839 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:16:39,949 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-09 07:16:39,950 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:16:39,957 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:16:39,957 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:16:39,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:16:39 BoogieIcfgContainer [2025-03-09 07:16:39,958 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:16:39,958 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:16:39,958 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:16:39,969 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:16:39,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:16:39,969 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:16:39" (1/3) ... [2025-03-09 07:16:39,970 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f29be4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:16:39, skipping insertion in model container [2025-03-09 07:16:39,970 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:16:39,970 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:39" (2/3) ... [2025-03-09 07:16:39,970 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f29be4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:16:39, skipping insertion in model container [2025-03-09 07:16:39,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:16:39,971 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:16:39" (3/3) ... [2025-03-09 07:16:39,974 INFO L363 chiAutomizerObserver]: Analyzing ICFG eureka_05.i [2025-03-09 07:16:40,020 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:16:40,020 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:16:40,020 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:16:40,020 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:16:40,020 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:16:40,021 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:16:40,021 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:16:40,021 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:16:40,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:40,042 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-03-09 07:16:40,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:40,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:40,046 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:16:40,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:16:40,047 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:16:40,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:40,049 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-03-09 07:16:40,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:40,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:40,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:16:40,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:16:40,057 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" [2025-03-09 07:16:40,058 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" [2025-03-09 07:16:40,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 1 times [2025-03-09 07:16:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:40,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207676874] [2025-03-09 07:16:40,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:40,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:40,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:40,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:40,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:40,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:40,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:40,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:40,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:40,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:40,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:40,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:40,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2025-03-09 07:16:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315133300] [2025-03-09 07:16:40,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:40,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:16:40,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:16:40,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:40,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:40,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:40,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:16:40,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:16:40,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:40,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:40,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:40,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash 51604, now seen corresponding path program 1 times [2025-03-09 07:16:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:40,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250956921] [2025-03-09 07:16:40,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:40,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:40,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:40,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:40,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:40,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:40,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:40,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:40,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:40,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:40,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:40,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:40,725 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:16:40,725 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:16:40,726 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:16:40,727 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:16:40,727 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:16:40,727 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:40,727 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:16:40,728 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:16:40,729 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration1_Lasso [2025-03-09 07:16:40,729 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:16:40,729 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:16:40,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:40,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:40,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:40,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:40,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:40,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:40,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:40,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:40,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:41,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:41,210 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:16:41,212 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:16:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,215 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) [2025-03-09 07:16:41,217 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 [2025-03-09 07:16:41,218 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 [2025-03-09 07:16:41,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:16:41,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:16:41,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:16:41,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,243 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 [2025-03-09 07:16:41,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,246 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) [2025-03-09 07:16:41,247 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 [2025-03-09 07:16:41,248 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 [2025-03-09 07:16:41,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 07:16:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,280 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) [2025-03-09 07:16:41,281 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 [2025-03-09 07:16:41,283 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 [2025-03-09 07:16:41,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 07:16:41,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,309 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) [2025-03-09 07:16:41,311 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 [2025-03-09 07:16:41,312 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 [2025-03-09 07:16:41,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,339 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 [2025-03-09 07:16:41,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,342 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) [2025-03-09 07:16:41,343 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 [2025-03-09 07:16:41,344 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 [2025-03-09 07:16:41,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 07:16:41,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,369 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) [2025-03-09 07:16:41,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 [2025-03-09 07:16:41,371 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 [2025-03-09 07:16:41,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 07:16:41,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,396 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) [2025-03-09 07:16:41,397 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 [2025-03-09 07:16:41,398 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 [2025-03-09 07:16:41,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,420 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 [2025-03-09 07:16:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,423 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) [2025-03-09 07:16:41,423 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 [2025-03-09 07:16:41,425 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 [2025-03-09 07:16:41,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:16:41,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:16:41,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:16:41,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,444 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 [2025-03-09 07:16:41,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,451 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) [2025-03-09 07:16:41,457 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 [2025-03-09 07:16:41,457 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 [2025-03-09 07:16:41,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,482 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 [2025-03-09 07:16:41,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,484 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) [2025-03-09 07:16:41,498 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 [2025-03-09 07:16:41,498 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 [2025-03-09 07:16:41,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:41,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 07:16:41,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,535 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) [2025-03-09 07:16:41,540 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 [2025-03-09 07:16:41,540 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 [2025-03-09 07:16:41,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:41,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:41,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:41,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:41,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:41,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:41,572 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:16:41,597 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-09 07:16:41,599 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-09 07:16:41,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:41,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:41,603 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) [2025-03-09 07:16:41,605 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 [2025-03-09 07:16:41,606 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:16:41,621 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:16:41,621 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:16:41,622 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~#array~1#1.base)_1) = 8*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~#array~1#1.base)_1 Supporting invariants [] [2025-03-09 07:16:41,632 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 [2025-03-09 07:16:41,646 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-09 07:16:41,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:16:41,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:16:41,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:41,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:41,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:41,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:41,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:41,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:16:41,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:41,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:16:41,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:16:41,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:41,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:41,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:16:41,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:41,725 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-09 07:16:41,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2025-03-09 07:16:41,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 19 states and 27 transitions. Complement of second has 3 states. [2025-03-09 07:16:41,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 07:16:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2025-03-09 07:16:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-09 07:16:41,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-09 07:16:41,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:41,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-09 07:16:41,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:41,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-09 07:16:41,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:41,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. [2025-03-09 07:16:41,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:16:41,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 24 transitions. [2025-03-09 07:16:41,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-09 07:16:41,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-09 07:16:41,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2025-03-09 07:16:41,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:41,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-03-09 07:16:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2025-03-09 07:16:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-09 07:16:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2025-03-09 07:16:41,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-03-09 07:16:41,795 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-03-09 07:16:41,795 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:16:41,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2025-03-09 07:16:41,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:16:41,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:41,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:41,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:16:41,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:16:41,797 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" [2025-03-09 07:16:41,797 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" [2025-03-09 07:16:41,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash 51603, now seen corresponding path program 1 times [2025-03-09 07:16:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:41,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758860404] [2025-03-09 07:16:41,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:41,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:41,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:41,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:41,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758860404] [2025-03-09 07:16:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758860404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:16:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:16:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:16:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295606310] [2025-03-09 07:16:41,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:16:41,862 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:16:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1500, now seen corresponding path program 1 times [2025-03-09 07:16:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913256433] [2025-03-09 07:16:41,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:41,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:41,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:41,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:41,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:41,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:41,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:41,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:41,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:41,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:41,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:41,957 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 [2025-03-09 07:16:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:41,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:16:41,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:16:41,983 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. cyclomatic complexity: 10 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-03-09 07:16:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:41,997 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-03-09 07:16:41,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-03-09 07:16:41,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:41,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 16 transitions. [2025-03-09 07:16:41,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 07:16:41,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 07:16:41,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-03-09 07:16:41,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:41,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-09 07:16:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-03-09 07:16:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-09 07:16:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-09 07:16:42,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-09 07:16:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:16:42,002 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-09 07:16:42,003 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:16:42,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-03-09 07:16:42,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:42,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:42,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:42,004 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:16:42,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:16:42,004 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" [2025-03-09 07:16:42,004 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" [2025-03-09 07:16:42,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1599743, now seen corresponding path program 1 times [2025-03-09 07:16:42,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450878671] [2025-03-09 07:16:42,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:16:42,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:16:42,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:42,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450878671] [2025-03-09 07:16:42,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450878671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971488786] [2025-03-09 07:16:42,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:42,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:42,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:42,059 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:42,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 07:16:42,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:16:42,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:16:42,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:42,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 07:16:42,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:42,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:42,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971488786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:42,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:42,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 07:16:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760322394] [2025-03-09 07:16:42,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:42,123 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:16:42,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1500, now seen corresponding path program 2 times [2025-03-09 07:16:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352525332] [2025-03-09 07:16:42,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:42,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:42,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:16:42,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:42,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:42,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:42,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:42,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 07:16:42,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 07:16:42,209 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:42,233 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2025-03-09 07:16:42,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2025-03-09 07:16:42,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:42,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2025-03-09 07:16:42,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-09 07:16:42,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-09 07:16:42,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2025-03-09 07:16:42,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:42,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-09 07:16:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2025-03-09 07:16:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-03-09 07:16:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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) [2025-03-09 07:16:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-09 07:16:42,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 07:16:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 07:16:42,237 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 07:16:42,238 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:16:42,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-03-09 07:16:42,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:42,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:42,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:42,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-03-09 07:16:42,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:16:42,238 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" [2025-03-09 07:16:42,238 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" [2025-03-09 07:16:42,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash 413353107, now seen corresponding path program 2 times [2025-03-09 07:16:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25728593] [2025-03-09 07:16:42,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-09 07:16:42,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:16:42,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25728593] [2025-03-09 07:16:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25728593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743953315] [2025-03-09 07:16:42,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:42,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:42,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:42,347 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:42,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 07:16:42,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-09 07:16:42,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:16:42,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:42,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:42,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:16:42,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:42,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:42,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743953315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:42,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:42,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-09 07:16:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579572771] [2025-03-09 07:16:42,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:42,429 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:16:42,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1500, now seen corresponding path program 3 times [2025-03-09 07:16:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980135884] [2025-03-09 07:16:42,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:16:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:42,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:42,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:16:42,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:42,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:42,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:42,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:42,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:16:42,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:16:42,532 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:42,584 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-09 07:16:42,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2025-03-09 07:16:42,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:42,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2025-03-09 07:16:42,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 07:16:42,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-09 07:16:42,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2025-03-09 07:16:42,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:42,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-09 07:16:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2025-03-09 07:16:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2025-03-09 07:16:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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) [2025-03-09 07:16:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-09 07:16:42,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 07:16:42,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:16:42,587 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 07:16:42,587 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:16:42,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2025-03-09 07:16:42,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:42,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:42,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:42,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1] [2025-03-09 07:16:42,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:16:42,588 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" [2025-03-09 07:16:42,588 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" [2025-03-09 07:16:42,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -70955521, now seen corresponding path program 3 times [2025-03-09 07:16:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492101718] [2025-03-09 07:16:42,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:16:42,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 4 equivalence classes. [2025-03-09 07:16:42,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:16:42,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 07:16:42,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:42,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:16:42,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:16:42,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:42,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1500, now seen corresponding path program 4 times [2025-03-09 07:16:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943777821] [2025-03-09 07:16:42,643 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:16:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 07:16:42,653 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:42,653 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:16:42,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:42,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:42,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:42,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:42,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash 531221594, now seen corresponding path program 1 times [2025-03-09 07:16:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467484996] [2025-03-09 07:16:42,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:16:42,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:16:42,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:42,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:42,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467484996] [2025-03-09 07:16:42,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467484996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:16:42,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:16:42,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:16:42,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309521336] [2025-03-09 07:16:42,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:16:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:42,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:16:42,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:16:42,809 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2025-03-09 07:16:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:42,837 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-03-09 07:16:42,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2025-03-09 07:16:42,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-03-09 07:16:42,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2025-03-09 07:16:42,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-09 07:16:42,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-09 07:16:42,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2025-03-09 07:16:42,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:42,838 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-09 07:16:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2025-03-09 07:16:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2025-03-09 07:16:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-09 07:16:42,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-09 07:16:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:16:42,840 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-09 07:16:42,840 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:16:42,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2025-03-09 07:16:42,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:42,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:42,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:42,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1] [2025-03-09 07:16:42,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:16:42,841 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:42,841 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:42,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 531221598, now seen corresponding path program 1 times [2025-03-09 07:16:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182036738] [2025-03-09 07:16:42,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:16:42,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:16:42,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:42,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:16:42,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:16:42,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:42,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash 43664, now seen corresponding path program 1 times [2025-03-09 07:16:42,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414692632] [2025-03-09 07:16:42,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:42,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:42,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:42,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,892 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:42,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:42,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:42,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:42,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:42,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1331845869, now seen corresponding path program 1 times [2025-03-09 07:16:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764191653] [2025-03-09 07:16:42,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:42,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:16:42,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:16:42,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:42,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 07:16:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764191653] [2025-03-09 07:16:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764191653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203482575] [2025-03-09 07:16:43,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:43,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:43,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:43,228 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:43,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 07:16:43,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:16:43,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:16:43,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:43,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:43,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 07:16:43,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:43,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 07:16:43,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-09 07:16:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:43,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 07:16:43,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203482575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:16:43,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 07:16:43,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-09 07:16:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012812269] [2025-03-09 07:16:43,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:16:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:43,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 07:16:43,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 07:16:43,470 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:43,519 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2025-03-09 07:16:43,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2025-03-09 07:16:43,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-03-09 07:16:43,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2025-03-09 07:16:43,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-09 07:16:43,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-09 07:16:43,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2025-03-09 07:16:43,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:43,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-09 07:16:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2025-03-09 07:16:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2025-03-09 07:16:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-09 07:16:43,522 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-09 07:16:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 07:16:43,525 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-09 07:16:43,525 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 07:16:43,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2025-03-09 07:16:43,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:43,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:43,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:43,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1] [2025-03-09 07:16:43,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:16:43,526 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" [2025-03-09 07:16:43,526 INFO L754 eck$LassoCheckResult]: Loop: "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1;" [2025-03-09 07:16:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash -711999631, now seen corresponding path program 1 times [2025-03-09 07:16:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820111603] [2025-03-09 07:16:43,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:43,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 07:16:43,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 07:16:43,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:43,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:43,559 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:43,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 07:16:43,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 07:16:43,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:43,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:43,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 42794, now seen corresponding path program 2 times [2025-03-09 07:16:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349908879] [2025-03-09 07:16:43,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:43,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:43,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:43,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:16:43,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:43,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:43,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:43,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:43,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:43,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:43,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:43,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1662480826, now seen corresponding path program 1 times [2025-03-09 07:16:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:43,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399244609] [2025-03-09 07:16:43,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:43,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:43,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:16:43,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:16:43,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:43,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399244609] [2025-03-09 07:16:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399244609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182629877] [2025-03-09 07:16:43,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:43,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:43,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:43,848 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:43,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 07:16:43,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:16:43,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:16:43,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:43,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:43,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 07:16:43,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:44,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 07:16:44,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 32 [2025-03-09 07:16:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:44,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:44,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182629877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:44,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:44,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-09 07:16:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519255470] [2025-03-09 07:16:44,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:44,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 07:16:44,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-03-09 07:16:44,394 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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) [2025-03-09 07:16:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:44,623 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-03-09 07:16:44,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2025-03-09 07:16:44,624 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-09 07:16:44,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2025-03-09 07:16:44,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 07:16:44,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-09 07:16:44,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2025-03-09 07:16:44,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:44,624 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-09 07:16:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2025-03-09 07:16:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2025-03-09 07:16:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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) [2025-03-09 07:16:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-09 07:16:44,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 07:16:44,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 07:16:44,626 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 07:16:44,626 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 07:16:44,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2025-03-09 07:16:44,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:44,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:44,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:44,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:16:44,627 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:16:44,627 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" [2025-03-09 07:16:44,627 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" [2025-03-09 07:16:44,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:44,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1331844912, now seen corresponding path program 1 times [2025-03-09 07:16:44,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:44,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775637707] [2025-03-09 07:16:44,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:44,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:16:44,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:16:44,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:44,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775637707] [2025-03-09 07:16:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775637707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622109940] [2025-03-09 07:16:44,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:44,706 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) [2025-03-09 07:16:44,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 07:16:44,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:16:44,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:16:44,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:44,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:44,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:16:44,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:44,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:44,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622109940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:44,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 07:16:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250536908] [2025-03-09 07:16:44,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:44,836 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:16:44,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1500, now seen corresponding path program 5 times [2025-03-09 07:16:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372238503] [2025-03-09 07:16:44,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:16:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:44,841 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:44,843 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:44,843 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:16:44,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:44,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:44,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:44,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:44,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:44,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:44,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:44,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:44,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 07:16:44,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-09 07:16:44,902 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 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) [2025-03-09 07:16:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:45,029 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2025-03-09 07:16:45,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2025-03-09 07:16:45,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-03-09 07:16:45,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2025-03-09 07:16:45,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-09 07:16:45,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-09 07:16:45,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2025-03-09 07:16:45,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:45,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2025-03-09 07:16:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2025-03-09 07:16:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-03-09 07:16:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 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) [2025-03-09 07:16:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-09 07:16:45,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-09 07:16:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 07:16:45,037 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-09 07:16:45,037 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 07:16:45,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2025-03-09 07:16:45,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-03-09 07:16:45,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:45,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:45,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 1, 1, 1, 1] [2025-03-09 07:16:45,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:16:45,038 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:45,038 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:45,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash 113253524, now seen corresponding path program 1 times [2025-03-09 07:16:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912736095] [2025-03-09 07:16:45,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:45,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:16:45,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:16:45,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:45,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:45,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:16:45,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:16:45,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:45,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:45,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:45,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 43664, now seen corresponding path program 3 times [2025-03-09 07:16:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815740592] [2025-03-09 07:16:45,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:16:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:45,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:45,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:45,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:16:45,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:45,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:45,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:45,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:45,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:45,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:45,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:45,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1908547299, now seen corresponding path program 2 times [2025-03-09 07:16:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:45,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564559248] [2025-03-09 07:16:45,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:45,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 07:16:45,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:16:45,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:45,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:16:45,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:45,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564559248] [2025-03-09 07:16:45,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564559248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:16:45,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:16:45,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 07:16:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340769266] [2025-03-09 07:16:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:16:45,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:45,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 07:16:45,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 07:16:45,235 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 12 Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:45,294 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-09 07:16:45,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2025-03-09 07:16:45,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:45,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2025-03-09 07:16:45,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-03-09 07:16:45,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-03-09 07:16:45,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2025-03-09 07:16:45,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:45,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-09 07:16:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2025-03-09 07:16:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 07:16:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2) internal successors, (42), 34 states have internal predecessors, (42), 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) [2025-03-09 07:16:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-09 07:16:45,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-09 07:16:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 07:16:45,298 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-09 07:16:45,298 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 07:16:45,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2025-03-09 07:16:45,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:45,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:45,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:45,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 2, 1, 1, 1, 1] [2025-03-09 07:16:45,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:16:45,299 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:45,299 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:45,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1439179481, now seen corresponding path program 2 times [2025-03-09 07:16:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:45,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137942973] [2025-03-09 07:16:45,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:45,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 07:16:45,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:45,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:45,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:45,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:45,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:16:45,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:45,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:45,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:45,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash 43664, now seen corresponding path program 4 times [2025-03-09 07:16:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441272977] [2025-03-09 07:16:45,338 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:16:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:45,341 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-09 07:16:45,342 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:45,342 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:16:45,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:45,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:45,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:45,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:45,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:45,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:45,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:45,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2062583624, now seen corresponding path program 1 times [2025-03-09 07:16:45,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:45,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817758281] [2025-03-09 07:16:45,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:45,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 07:16:45,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:16:45,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:45,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 07:16:45,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:45,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817758281] [2025-03-09 07:16:45,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817758281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472776049] [2025-03-09 07:16:45,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:45,888 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:45,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 07:16:45,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 07:16:45,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:16:45,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:45,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:45,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 07:16:45,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:46,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:16:46,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:16:46,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:16:46,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 07:16:46,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 21 [2025-03-09 07:16:46,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 07:16:46,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 07:16:46,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 07:16:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 07:16:46,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 07:16:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472776049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:46,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:46,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 26 [2025-03-09 07:16:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213049459] [2025-03-09 07:16:46,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:46,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:46,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 07:16:46,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2025-03-09 07:16:46,619 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 10 Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:47,184 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-03-09 07:16:47,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2025-03-09 07:16:47,184 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-09 07:16:47,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2025-03-09 07:16:47,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-09 07:16:47,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-03-09 07:16:47,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2025-03-09 07:16:47,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:47,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-09 07:16:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2025-03-09 07:16:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2025-03-09 07:16:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 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) [2025-03-09 07:16:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-09 07:16:47,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-09 07:16:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 07:16:47,192 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-09 07:16:47,192 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 07:16:47,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2025-03-09 07:16:47,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:47,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:47,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:47,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 2, 1, 1, 1, 1, 1] [2025-03-09 07:16:47,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:16:47,194 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:47,194 INFO L754 eck$LassoCheckResult]: Loop: "assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:47,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash -303630854, now seen corresponding path program 2 times [2025-03-09 07:16:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:47,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021851520] [2025-03-09 07:16:47,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:47,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:47,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 07:16:47,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:47,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:47,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 07:16:47,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:47,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021851520] [2025-03-09 07:16:47,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021851520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:47,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974760659] [2025-03-09 07:16:47,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:47,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:47,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:47,518 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:47,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 07:16:47,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 07:16:47,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:47,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:47,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:47,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:16:47,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:47,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 07:16:47,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 32 [2025-03-09 07:16:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 07:16:47,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 07:16:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974760659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:48,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-09 07:16:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952512544] [2025-03-09 07:16:48,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:48,182 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:16:48,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash 43664, now seen corresponding path program 5 times [2025-03-09 07:16:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:48,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64522573] [2025-03-09 07:16:48,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:16:48,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:48,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:48,185 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:48,185 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:16:48,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:48,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:48,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:48,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:48,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:48,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:48,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:48,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 07:16:48,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2025-03-09 07:16:48,243 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 9 Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:48,630 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-03-09 07:16:48,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2025-03-09 07:16:48,631 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-09 07:16:48,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2025-03-09 07:16:48,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-09 07:16:48,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-09 07:16:48,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2025-03-09 07:16:48,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:48,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-03-09 07:16:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2025-03-09 07:16:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-03-09 07:16:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 35 states have internal predecessors, (40), 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) [2025-03-09 07:16:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-09 07:16:48,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-09 07:16:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 07:16:48,638 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-09 07:16:48,638 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 07:16:48,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2025-03-09 07:16:48,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:48,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:48,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:48,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 2, 1, 1, 1, 1] [2025-03-09 07:16:48,639 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:16:48,639 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" [2025-03-09 07:16:48,639 INFO L754 eck$LassoCheckResult]: Loop: "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1;" [2025-03-09 07:16:48,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1664890966, now seen corresponding path program 3 times [2025-03-09 07:16:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:48,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649537126] [2025-03-09 07:16:48,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:16:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:48,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 6 equivalence classes. [2025-03-09 07:16:48,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:16:48,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 07:16:48,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:48,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:48,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:16:48,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:16:48,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:48,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:48,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:48,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash 42794, now seen corresponding path program 6 times [2025-03-09 07:16:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:48,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312479848] [2025-03-09 07:16:48,694 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 07:16:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:48,697 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:48,698 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:48,699 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 07:16:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:48,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:48,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:48,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:48,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:48,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:48,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:48,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash 484446901, now seen corresponding path program 3 times [2025-03-09 07:16:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:48,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736199111] [2025-03-09 07:16:48,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:16:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:48,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-03-09 07:16:48,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 31 statements. [2025-03-09 07:16:48,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 07:16:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 07:16:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736199111] [2025-03-09 07:16:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736199111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680971622] [2025-03-09 07:16:49,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:16:49,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:49,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:49,139 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:49,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 07:16:49,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-03-09 07:16:49,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 31 statements. [2025-03-09 07:16:49,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 07:16:49,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:49,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-09 07:16:49,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:49,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:16:49,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 07:16:49,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2025-03-09 07:16:49,746 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-09 07:16:49,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 22 [2025-03-09 07:16:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-09 07:16:49,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-09 07:16:50,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680971622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:50,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:50,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-09 07:16:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605671552] [2025-03-09 07:16:50,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:50,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 07:16:50,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-03-09 07:16:50,233 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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) [2025-03-09 07:16:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:51,053 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-03-09 07:16:51,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2025-03-09 07:16:51,053 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2025-03-09 07:16:51,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2025-03-09 07:16:51,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-03-09 07:16:51,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2025-03-09 07:16:51,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2025-03-09 07:16:51,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:51,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-03-09 07:16:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2025-03-09 07:16:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2025-03-09 07:16:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-09 07:16:51,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-09 07:16:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 07:16:51,060 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-09 07:16:51,060 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 07:16:51,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2025-03-09 07:16:51,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:16:51,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:51,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:51,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 2, 1, 1, 1, 1] [2025-03-09 07:16:51,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:16:51,063 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:51,063 INFO L754 eck$LassoCheckResult]: Loop: "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" [2025-03-09 07:16:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1439179481, now seen corresponding path program 4 times [2025-03-09 07:16:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-09 07:16:51,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:16:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:51,069 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-09 07:16:51,079 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:51,079 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:16:51,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:51,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:51,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:16:51,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:51,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:51,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:51,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:51,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 44625, now seen corresponding path program 1 times [2025-03-09 07:16:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580884028] [2025-03-09 07:16:51,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:51,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:51,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:51,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:51,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:51,093 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:51,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:51,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:51,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2062582663, now seen corresponding path program 5 times [2025-03-09 07:16:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:51,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843681042] [2025-03-09 07:16:51,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:16:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:51,100 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 6 equivalence classes. [2025-03-09 07:16:51,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:16:51,117 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 07:16:51,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:51,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:51,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 07:16:51,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:16:51,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:51,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:51,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:53,188 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:16:53,188 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:16:53,188 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:16:53,188 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:16:53,188 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:16:53,189 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:53,189 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:16:53,189 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:16:53,189 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration13_Lasso [2025-03-09 07:16:53,189 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:16:53,189 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:16:53,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:53,893 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:16:53,893 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:16:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:53,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:53,896 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) [2025-03-09 07:16:53,897 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 [2025-03-09 07:16:53,901 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 [2025-03-09 07:16:53,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:53,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:53,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:53,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:53,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:53,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:53,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:53,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 07:16:53,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:53,927 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) [2025-03-09 07:16:53,929 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 [2025-03-09 07:16:53,929 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 [2025-03-09 07:16:53,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:53,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:53,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:53,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:53,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:53,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:53,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:53,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 07:16:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:53,956 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) [2025-03-09 07:16:53,957 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 [2025-03-09 07:16:53,958 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 [2025-03-09 07:16:53,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:53,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:53,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:53,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:53,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:53,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:53,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:53,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 07:16:53,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:53,980 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) [2025-03-09 07:16:53,981 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 [2025-03-09 07:16:53,982 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 [2025-03-09 07:16:53,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:53,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:53,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:53,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:53,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:53,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:53,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,002 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 [2025-03-09 07:16:54,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,005 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) [2025-03-09 07:16:54,006 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 [2025-03-09 07:16:54,007 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 [2025-03-09 07:16:54,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 07:16:54,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,028 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) [2025-03-09 07:16:54,029 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 [2025-03-09 07:16:54,029 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 [2025-03-09 07:16:54,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 07:16:54,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,055 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) [2025-03-09 07:16:54,057 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 [2025-03-09 07:16:54,057 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 [2025-03-09 07:16:54,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 07:16:54,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,078 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) [2025-03-09 07:16:54,080 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 [2025-03-09 07:16:54,080 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 [2025-03-09 07:16:54,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 07:16:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,112 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) [2025-03-09 07:16:54,113 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 [2025-03-09 07:16:54,114 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 [2025-03-09 07:16:54,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 07:16:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,136 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:54,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 07:16:54,137 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 [2025-03-09 07:16:54,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 07:16:54,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,158 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:54,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 07:16:54,160 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 [2025-03-09 07:16:54,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 07:16:54,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,184 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:54,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 07:16:54,186 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 [2025-03-09 07:16:54,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 07:16:54,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,211 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:54,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 07:16:54,212 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 [2025-03-09 07:16:54,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 07:16:54,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,234 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:54,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 07:16:54,236 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 [2025-03-09 07:16:54,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 07:16:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,257 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:54,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 07:16:54,259 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 [2025-03-09 07:16:54,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:54,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-09 07:16:54,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,283 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:54,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 07:16:54,285 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 [2025-03-09 07:16:54,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:54,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:54,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:54,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:54,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:54,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:54,312 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:16:54,336 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-09 07:16:54,336 INFO L444 ModelExtractionUtils]: 0 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-03-09 07:16:54,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:54,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:54,339 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:54,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 07:16:54,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:16:54,350 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 07:16:54,350 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:16:54,351 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length 3)_2, ULTIMATE.start_SelectionSort_~i~0#1) = 1*v_rep(select #length 3)_2 - 2*ULTIMATE.start_SelectionSort_~i~0#1 Supporting invariants [1*v_rep(select #length 3)_2 - 2*~n~0 >= 0] [2025-03-09 07:16:54,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 07:16:54,388 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2025-03-09 07:16:54,389 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:16:54,390 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:16:54,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:54,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:16:54,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:54,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:54,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:54,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:16:54,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:54,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 07:16:54,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:54,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:54,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:54,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:54,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:16:54,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:54,701 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 07:16:54,701 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) [2025-03-09 07:16:54,801 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 38 transitions. cyclomatic complexity: 6. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) Result 43 states and 46 transitions. Complement of second has 10 states. [2025-03-09 07:16:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:16:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) [2025-03-09 07:16:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-03-09 07:16:54,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 27 letters. Loop has 3 letters. [2025-03-09 07:16:54,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:54,803 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:16:54,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:54,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:16:54,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:54,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:54,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:54,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:16:54,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:55,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:55,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:55,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:55,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:55,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:16:55,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:55,093 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 07:16:55,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) [2025-03-09 07:16:55,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 38 transitions. cyclomatic complexity: 6. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) Result 43 states and 46 transitions. Complement of second has 10 states. [2025-03-09 07:16:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:16:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) [2025-03-09 07:16:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-03-09 07:16:55,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 27 letters. Loop has 3 letters. [2025-03-09 07:16:55,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:55,189 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:16:55,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:55,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:16:55,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:16:55,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:55,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:55,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:16:55,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:55,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:16:55,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:16:55,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:55,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:55,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:16:55,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:55,474 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 07:16:55,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) [2025-03-09 07:16:55,684 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 38 transitions. cyclomatic complexity: 6. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) Result 61 states and 68 transitions. Complement of second has 22 states. [2025-03-09 07:16:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:16:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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) [2025-03-09 07:16:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2025-03-09 07:16:55,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 33 transitions. Stem has 27 letters. Loop has 3 letters. [2025-03-09 07:16:55,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:55,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 33 transitions. Stem has 30 letters. Loop has 3 letters. [2025-03-09 07:16:55,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:55,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 33 transitions. Stem has 27 letters. Loop has 6 letters. [2025-03-09 07:16:55,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:55,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 68 transitions. [2025-03-09 07:16:55,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-03-09 07:16:55,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 58 transitions. [2025-03-09 07:16:55,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-09 07:16:55,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-03-09 07:16:55,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 58 transitions. [2025-03-09 07:16:55,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:16:55,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-09 07:16:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 58 transitions. [2025-03-09 07:16:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2025-03-09 07:16:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 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) [2025-03-09 07:16:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-09 07:16:55,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-09 07:16:55,692 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-09 07:16:55,692 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 07:16:55,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 42 transitions. [2025-03-09 07:16:55,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 07:16:55,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:55,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:55,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 2, 1, 1, 1, 1] [2025-03-09 07:16:55,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 07:16:55,693 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" [2025-03-09 07:16:55,693 INFO L754 eck$LassoCheckResult]: Loop: "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" [2025-03-09 07:16:55,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1664890966, now seen corresponding path program 6 times [2025-03-09 07:16:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161447603] [2025-03-09 07:16:55,694 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 07:16:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:55,700 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 6 equivalence classes. [2025-03-09 07:16:55,719 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:16:55,720 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-09 07:16:55,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:55,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:55,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:16:55,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:16:55,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:55,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:55,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash 41009264, now seen corresponding path program 1 times [2025-03-09 07:16:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:55,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742888191] [2025-03-09 07:16:55,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:55,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:55,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:55,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:55,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:55,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:55,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:55,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:55,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:55,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:55,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:55,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1696888123, now seen corresponding path program 7 times [2025-03-09 07:16:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:55,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972131234] [2025-03-09 07:16:55,743 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 07:16:55,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:55,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 07:16:55,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 07:16:55,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:55,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 07:16:55,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972131234] [2025-03-09 07:16:55,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972131234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262981888] [2025-03-09 07:16:55,873 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 07:16:55,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:55,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:55,875 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:55,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-09 07:16:55,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 07:16:55,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 07:16:55,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:55,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:55,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:16:55,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 07:16:56,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 07:16:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262981888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:56,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:56,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 07:16:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108652447] [2025-03-09 07:16:56,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:56,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 07:16:56,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-09 07:16:56,268 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. cyclomatic complexity: 8 Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 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) [2025-03-09 07:16:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:56,359 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-03-09 07:16:56,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 59 transitions. [2025-03-09 07:16:56,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 07:16:56,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 57 transitions. [2025-03-09 07:16:56,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-03-09 07:16:56,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-03-09 07:16:56,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 57 transitions. [2025-03-09 07:16:56,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:16:56,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-09 07:16:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 57 transitions. [2025-03-09 07:16:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2025-03-09 07:16:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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) [2025-03-09 07:16:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-03-09 07:16:56,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-03-09 07:16:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 07:16:56,363 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-03-09 07:16:56,364 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 07:16:56,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2025-03-09 07:16:56,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 07:16:56,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:56,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:56,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 2, 1, 1, 1, 1] [2025-03-09 07:16:56,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 07:16:56,365 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" [2025-03-09 07:16:56,365 INFO L754 eck$LassoCheckResult]: Loop: "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" [2025-03-09 07:16:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 484446902, now seen corresponding path program 8 times [2025-03-09 07:16:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654392379] [2025-03-09 07:16:56,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 07:16:56,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:16:56,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:56,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:16:56,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:16:56,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:56,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash 41009264, now seen corresponding path program 2 times [2025-03-09 07:16:56,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086360038] [2025-03-09 07:16:56,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-03-09 07:16:56,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:56,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:56,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:56,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:56,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:56,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -576055589, now seen corresponding path program 9 times [2025-03-09 07:16:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013380801] [2025-03-09 07:16:56,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:16:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 9 equivalence classes. [2025-03-09 07:16:56,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 07:16:56,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 07:16:56,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 07:16:56,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 07:16:56,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:58,752 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:16:58,752 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:16:58,752 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:16:58,752 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:16:58,752 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:16:58,752 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:58,754 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:16:58,754 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:16:58,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration15_Lasso [2025-03-09 07:16:58,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:16:58,754 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:16:58,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:16:59,494 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:16:59,495 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:16:59,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:59,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:59,497 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:59,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 07:16:59,499 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 [2025-03-09 07:16:59,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:59,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:59,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:59,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:59,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:59,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:59,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:59,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-09 07:16:59,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:59,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:59,522 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:59,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 07:16:59,523 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 [2025-03-09 07:16:59,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:59,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:59,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:59,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:59,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:59,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:59,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:59,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-09 07:16:59,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:59,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:59,543 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:59,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 07:16:59,545 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 [2025-03-09 07:16:59,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:59,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:59,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:59,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:59,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:59,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:59,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:59,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-09 07:16:59,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:59,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:59,568 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:59,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 07:16:59,570 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 [2025-03-09 07:16:59,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:59,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:59,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:59,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:59,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:59,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:59,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:16:59,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-09 07:16:59,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:59,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:59,593 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:59,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 07:16:59,596 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 [2025-03-09 07:16:59,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:16:59,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:16:59,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:16:59,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:16:59,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:16:59,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:16:59,621 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:16:59,648 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-09 07:16:59,648 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-03-09 07:16:59,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:59,651 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2025-03-09 07:16:59,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-09 07:16:59,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:16:59,662 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:16:59,663 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:16:59,663 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~rh~0#1, ULTIMATE.start_SelectionSort_~i~0#1) = -1*ULTIMATE.start_SelectionSort_~rh~0#1 + 1*ULTIMATE.start_SelectionSort_~i~0#1 Supporting invariants [] [2025-03-09 07:16:59,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-09 07:16:59,699 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2025-03-09 07:16:59,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:59,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:16:59,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:16:59,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:59,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:59,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:16:59,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:59,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:59,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:59,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:59,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:59,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 07:16:59,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:59,836 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-09 07:16:59,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2025-03-09 07:16:59,857 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 48 transitions. Complement of second has 6 states. [2025-03-09 07:16:59,858 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 [2025-03-09 07:16:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2025-03-09 07:16:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-09 07:16:59,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 31 letters. Loop has 5 letters. [2025-03-09 07:16:59,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:16:59,859 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:16:59,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:59,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:16:59,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:16:59,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:59,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:59,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:16:59,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:59,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:59,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:59,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:59,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:59,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:16:59,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:00,019 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-09 07:17:00,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2025-03-09 07:17:00,044 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 48 transitions. Complement of second has 6 states. [2025-03-09 07:17:00,045 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 [2025-03-09 07:17:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2025-03-09 07:17:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-09 07:17:00,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 31 letters. Loop has 5 letters. [2025-03-09 07:17:00,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:00,046 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:17:00,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:00,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:17:00,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:17:00,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:00,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:00,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:17:00,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:00,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:17:00,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:17:00,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:00,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:00,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:17:00,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:00,165 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 5 loop predicates [2025-03-09 07:17:00,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2025-03-09 07:17:00,216 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 79 transitions. Complement of second has 13 states. [2025-03-09 07:17:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-09 07:17:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2025-03-09 07:17:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2025-03-09 07:17:00,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 31 letters. Loop has 5 letters. [2025-03-09 07:17:00,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:00,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 36 letters. Loop has 5 letters. [2025-03-09 07:17:00,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:00,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 31 letters. Loop has 10 letters. [2025-03-09 07:17:00,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:00,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 79 transitions. [2025-03-09 07:17:00,218 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-09 07:17:00,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 47 states and 54 transitions. [2025-03-09 07:17:00,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-09 07:17:00,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-09 07:17:00,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 54 transitions. [2025-03-09 07:17:00,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:00,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-03-09 07:17:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 54 transitions. [2025-03-09 07:17:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2025-03-09 07:17:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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) [2025-03-09 07:17:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-03-09 07:17:00,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-09 07:17:00,220 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-09 07:17:00,220 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 07:17:00,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2025-03-09 07:17:00,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2025-03-09 07:17:00,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:00,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:00,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 2, 1, 1, 1, 1] [2025-03-09 07:17:00,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-03-09 07:17:00,221 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" [2025-03-09 07:17:00,221 INFO L754 eck$LassoCheckResult]: Loop: "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" [2025-03-09 07:17:00,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash 484446902, now seen corresponding path program 10 times [2025-03-09 07:17:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:00,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-03-09 07:17:00,222 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:00,228 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-09 07:17:00,237 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:17:00,237 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:17:00,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:00,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:00,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:17:00,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:17:00,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:00,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:00,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:00,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1936284764, now seen corresponding path program 3 times [2025-03-09 07:17:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592195896] [2025-03-09 07:17:00,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:00,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 3 equivalence classes. [2025-03-09 07:17:00,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:00,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 07:17:00,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:00,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:00,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:00,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:00,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:00,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:00,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1417275921, now seen corresponding path program 11 times [2025-03-09 07:17:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651011271] [2025-03-09 07:17:00,255 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:17:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:00,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 9 equivalence classes. [2025-03-09 07:17:00,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-09 07:17:00,290 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:17:00,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-09 07:17:00,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:00,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:00,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 07:17:00,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:17:00,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:00,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:00,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:03,064 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:03,064 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:03,064 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:03,064 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:03,064 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:03,064 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:03,064 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:03,064 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:03,064 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration16_Lasso [2025-03-09 07:17:03,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:03,064 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:03,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:03,862 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:03,863 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:03,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:03,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,865 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2025-03-09 07:17:03,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 07:17:03,867 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 [2025-03-09 07:17:03,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:03,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:03,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:03,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:03,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:03,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:03,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:03,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:03,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:03,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:03,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,885 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2025-03-09 07:17:03,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 07:17:03,887 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 [2025-03-09 07:17:03,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:03,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:03,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:03,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:03,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:03,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:03,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:03,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:03,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-09 07:17:03,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:03,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,906 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2025-03-09 07:17:03,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 07:17:03,907 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 [2025-03-09 07:17:03,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:03,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:03,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:03,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:03,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:03,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:03,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:03,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:03,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-09 07:17:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,926 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2025-03-09 07:17:03,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 07:17:03,928 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 [2025-03-09 07:17:03,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:03,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:03,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:03,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:03,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:03,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:03,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:03,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:03,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-09 07:17:03,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:03,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,947 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2025-03-09 07:17:03,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 07:17:03,948 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 [2025-03-09 07:17:03,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:03,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:03,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:03,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:03,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:03,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:03,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:03,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-09 07:17:03,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:03,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,969 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2025-03-09 07:17:03,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-09 07:17:03,971 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 [2025-03-09 07:17:03,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:03,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:03,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:03,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:03,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:03,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:03,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:03,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 07:17:03,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:03,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,991 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2025-03-09 07:17:03,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 07:17:03,993 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 [2025-03-09 07:17:04,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:04,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:04,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:04,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:04,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:04,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:04,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:04,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:04,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-09 07:17:04,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:04,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:04,012 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2025-03-09 07:17:04,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 07:17:04,013 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 [2025-03-09 07:17:04,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:04,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:04,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:04,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:04,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:04,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:04,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:04,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:04,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-09 07:17:04,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:04,032 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2025-03-09 07:17:04,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-09 07:17:04,033 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 [2025-03-09 07:17:04,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:04,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:04,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:04,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:04,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:04,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:04,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:04,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:04,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-09 07:17:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:04,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:04,053 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2025-03-09 07:17:04,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 07:17:04,055 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 [2025-03-09 07:17:04,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:04,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:04,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:04,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:04,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:04,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:04,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:04,091 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 07:17:04,091 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-09 07:17:04,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:04,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:04,093 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2025-03-09 07:17:04,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 07:17:04,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:04,105 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:04,105 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:04,105 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length 3)_4, ~#array~0.offset, ULTIMATE.start_SelectionSort_~lh~0#1) = 1*v_rep(select #length 3)_4 - 1*~#array~0.offset - 4*ULTIMATE.start_SelectionSort_~lh~0#1 Supporting invariants [] [2025-03-09 07:17:04,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:04,149 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2025-03-09 07:17:04,151 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#array~0!offset [2025-03-09 07:17:04,151 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:17:04,151 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:17:04,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:04,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:17:04,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:17:04,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:04,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:04,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:17:04,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:04,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:04,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:04,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:04,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:04,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:17:04,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:04,309 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-09 07:17:04,309 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:04,334 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 11. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 81 transitions. Complement of second has 6 states. [2025-03-09 07:17:04,334 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 [2025-03-09 07:17:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-09 07:17:04,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 31 letters. Loop has 8 letters. [2025-03-09 07:17:04,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:04,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 39 letters. Loop has 8 letters. [2025-03-09 07:17:04,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:04,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 31 letters. Loop has 16 letters. [2025-03-09 07:17:04,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:04,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 81 transitions. [2025-03-09 07:17:04,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 07:17:04,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 44 states and 51 transitions. [2025-03-09 07:17:04,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 07:17:04,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 07:17:04,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 51 transitions. [2025-03-09 07:17:04,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:04,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-09 07:17:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 51 transitions. [2025-03-09 07:17:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 07:17:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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) [2025-03-09 07:17:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-03-09 07:17:04,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-09 07:17:04,338 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-09 07:17:04,338 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 07:17:04,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2025-03-09 07:17:04,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 07:17:04,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:04,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:04,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 07:17:04,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:17:04,338 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume !(SelectionSort_~lh~0#1 < ~n~0);" "havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;assume { :end_inline_SelectionSort } true;main_~i~1#1 := 0;" [2025-03-09 07:17:04,339 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < 5;call main_#t~mem8#1 := read~int#2(main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem8#1 == main_~i~1#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-09 07:17:04,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1265508402, now seen corresponding path program 1 times [2025-03-09 07:17:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103184797] [2025-03-09 07:17:04,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:04,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 07:17:04,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 07:17:04,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:04,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 07:17:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103184797] [2025-03-09 07:17:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103184797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629788787] [2025-03-09 07:17:04,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:04,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:04,396 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:04,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-03-09 07:17:04,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 07:17:04,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 07:17:04,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:04,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:04,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:17:04,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 07:17:04,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 07:17:04,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629788787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:04,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 07:17:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876675763] [2025-03-09 07:17:04,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:04,595 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:04,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash 39682, now seen corresponding path program 1 times [2025-03-09 07:17:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:04,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400029858] [2025-03-09 07:17:04,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:04,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:04,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:04,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:04,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:04,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:04,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:04,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:04,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:04,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:04,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:04,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 07:17:04,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-09 07:17:04,633 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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) [2025-03-09 07:17:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:04,668 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2025-03-09 07:17:04,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 95 transitions. [2025-03-09 07:17:04,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 07:17:04,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 95 transitions. [2025-03-09 07:17:04,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 07:17:04,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 07:17:04,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 95 transitions. [2025-03-09 07:17:04,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:04,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 95 transitions. [2025-03-09 07:17:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 95 transitions. [2025-03-09 07:17:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-03-09 07:17:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 72 states have internal predecessors, (92), 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) [2025-03-09 07:17:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-03-09 07:17:04,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-03-09 07:17:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 07:17:04,672 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-03-09 07:17:04,672 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-09 07:17:04,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 92 transitions. [2025-03-09 07:17:04,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 07:17:04,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:04,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:04,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-09 07:17:04,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:17:04,674 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume !(SelectionSort_~lh~0#1 < ~n~0);" "havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;assume { :end_inline_SelectionSort } true;main_~i~1#1 := 0;" [2025-03-09 07:17:04,674 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < 5;call main_#t~mem8#1 := read~int#2(main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem8#1 == main_~i~1#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-09 07:17:04,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1298842079, now seen corresponding path program 2 times [2025-03-09 07:17:04,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015718351] [2025-03-09 07:17:04,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:04,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-09 07:17:04,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:17:04,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:04,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 29 proven. 56 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-09 07:17:04,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:04,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015718351] [2025-03-09 07:17:04,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015718351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:04,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210561572] [2025-03-09 07:17:04,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:04,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:04,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:04,745 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:04,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-03-09 07:17:04,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-09 07:17:04,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:17:04,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:04,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:04,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:17:04,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:04,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 29 proven. 56 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-09 07:17:04,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 29 proven. 56 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-09 07:17:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210561572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:04,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 07:17:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894885283] [2025-03-09 07:17:04,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:04,992 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 39682, now seen corresponding path program 2 times [2025-03-09 07:17:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591790823] [2025-03-09 07:17:04,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:04,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:04,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:04,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:17:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:04,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:04,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:04,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:04,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:04,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:05,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:05,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:05,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 07:17:05,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-09 07:17:05,026 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. cyclomatic complexity: 26 Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:05,118 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-03-09 07:17:05,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 94 transitions. [2025-03-09 07:17:05,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 07:17:05,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 84 transitions. [2025-03-09 07:17:05,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 07:17:05,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 07:17:05,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 84 transitions. [2025-03-09 07:17:05,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:05,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-09 07:17:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 84 transitions. [2025-03-09 07:17:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-03-09 07:17:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-03-09 07:17:05,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-03-09 07:17:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 07:17:05,121 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-03-09 07:17:05,121 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-09 07:17:05,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2025-03-09 07:17:05,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 07:17:05,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:05,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:05,122 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-09 07:17:05,122 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:17:05,122 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~i~1#1 >= 0;call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume !(main_~i~1#1 >= 0);assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume SelectionSort_~i~0#1 < ~n~0;call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);" "assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;" "SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume SelectionSort_~lh~0#1 < ~n~0;SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1;" "assume !(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1;" "assume !(SelectionSort_~lh~0#1 < ~n~0);" "havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;assume { :end_inline_SelectionSort } true;main_~i~1#1 := 0;" [2025-03-09 07:17:05,122 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < 5;call main_#t~mem8#1 := read~int#2(main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem8#1 == main_~i~1#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-09 07:17:05,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1008346093, now seen corresponding path program 3 times [2025-03-09 07:17:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438898715] [2025-03-09 07:17:05,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:05,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 12 equivalence classes. [2025-03-09 07:17:05,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 07:17:05,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 07:17:05,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:05,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:05,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 07:17:05,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 07:17:05,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:05,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:05,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:05,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash 39682, now seen corresponding path program 3 times [2025-03-09 07:17:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104022793] [2025-03-09 07:17:05,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:05,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:05,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:05,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:17:05,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:05,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:05,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:05,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:05,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:05,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:05,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:05,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash -637178448, now seen corresponding path program 1 times [2025-03-09 07:17:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:05,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443174104] [2025-03-09 07:17:05,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:05,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 07:17:05,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 07:17:05,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:05,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:05,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:05,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 07:17:05,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 07:17:05,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:05,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:05,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:32,396 WARN L286 SmtUtils]: Spent 27.12s on a formula simplification. DAG size of input: 451 DAG size of output: 337 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 07:17:32,665 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:32,666 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:32,666 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:32,666 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:32,666 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:32,666 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:32,666 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:32,666 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:32,666 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration19_Lasso [2025-03-09 07:17:32,666 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:32,666 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:32,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:32,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:33,174 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:33,174 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:33,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,176 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2025-03-09 07:17:33,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-09 07:17:33,181 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 [2025-03-09 07:17:33,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:33,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:33,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:33,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-09 07:17:33,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,204 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2025-03-09 07:17:33,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-09 07:17:33,206 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 [2025-03-09 07:17:33,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-09 07:17:33,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,228 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2025-03-09 07:17:33,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 07:17:33,230 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 [2025-03-09 07:17:33,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:33,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,253 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2025-03-09 07:17:33,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-09 07:17:33,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:33,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:33,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,276 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2025-03-09 07:17:33,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 07:17:33,278 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 [2025-03-09 07:17:33,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-09 07:17:33,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,299 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2025-03-09 07:17:33,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 07:17:33,300 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 [2025-03-09 07:17:33,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-09 07:17:33,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,321 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2025-03-09 07:17:33,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 07:17:33,323 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 [2025-03-09 07:17:33,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 07:17:33,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,352 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2025-03-09 07:17:33,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-09 07:17:33,354 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 [2025-03-09 07:17:33,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:33,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,377 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2025-03-09 07:17:33,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-09 07:17:33,379 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 [2025-03-09 07:17:33,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-09 07:17:33,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,402 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2025-03-09 07:17:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-09 07:17:33,404 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 [2025-03-09 07:17:33,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:33,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,432 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2025-03-09 07:17:33,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-09 07:17:33,434 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 [2025-03-09 07:17:33,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:33,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,458 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2025-03-09 07:17:33,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-09 07:17:33,460 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 [2025-03-09 07:17:33,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-09 07:17:33,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,482 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2025-03-09 07:17:33,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-09 07:17:33,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 [2025-03-09 07:17:33,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:33,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-09 07:17:33,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,506 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2025-03-09 07:17:33,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-09 07:17:33,509 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 [2025-03-09 07:17:33,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:33,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:33,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:33,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:33,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:33,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:33,532 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:33,540 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-09 07:17:33,541 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 07:17:33,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:33,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:33,543 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2025-03-09 07:17:33,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-09 07:17:33,544 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:33,555 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:33,555 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:33,555 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1) = -2*ULTIMATE.start_main_~i~1#1 + 9 Supporting invariants [] [2025-03-09 07:17:33,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-09 07:17:33,568 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-09 07:17:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:33,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 07:17:33,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 07:17:33,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:33,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:33,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:17:33,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:33,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:33,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:33,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:33,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:33,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:17:33,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:33,701 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 [2025-03-09 07:17:33,701 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2025-03-09 07:17:33,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) Result 70 states and 84 transitions. Complement of second has 4 states. [2025-03-09 07:17:33,715 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 [2025-03-09 07:17:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2025-03-09 07:17:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-09 07:17:33,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 50 letters. Loop has 3 letters. [2025-03-09 07:17:33,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:33,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 53 letters. Loop has 3 letters. [2025-03-09 07:17:33,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:33,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 50 letters. Loop has 6 letters. [2025-03-09 07:17:33,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:33,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 84 transitions. [2025-03-09 07:17:33,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:17:33,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 0 states and 0 transitions. [2025-03-09 07:17:33,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:17:33,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:17:33,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:17:33,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:17:33,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:17:33,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:17:33,718 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:17:33,718 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-09 07:17:33,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:17:33,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:17:33,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:17:33,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:17:33 BoogieIcfgContainer [2025-03-09 07:17:33,725 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:17:33,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:17:33,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:17:33,726 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:17:33,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:16:39" (3/4) ... [2025-03-09 07:17:33,728 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:17:33,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:17:33,729 INFO L158 Benchmark]: Toolchain (without parser) took 54259.43ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 122.0MB in the beginning and 199.0MB in the end (delta: -77.0MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. [2025-03-09 07:17:33,729 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:17:33,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.44ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 111.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:17:33,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.16ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:17:33,730 INFO L158 Benchmark]: Boogie Preprocessor took 36.75ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:17:33,730 INFO L158 Benchmark]: IcfgBuilder took 242.15ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 95.4MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:17:33,730 INFO L158 Benchmark]: BuchiAutomizer took 53766.45ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 95.4MB in the beginning and 199.1MB in the end (delta: -103.7MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2025-03-09 07:17:33,731 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 352.3MB. Free memory was 199.1MB in the beginning and 199.0MB in the end (delta: 106.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:17:33,732 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.26ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.44ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 111.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.16ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.75ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 242.15ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 95.4MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 53766.45ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 95.4MB in the beginning and 199.1MB in the end (delta: -103.7MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 352.3MB. Free memory was 199.1MB in the beginning and 199.0MB in the end (delta: 106.1kB). 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - 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: ~#array~0!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 19 terminating modules (14 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (9 + ((long long) -2 * i)) and consists of 3 locations. One nondeterministic module has affine ranking function null and consists of 10 locations. One nondeterministic module has affine ranking function (i + ((long long) -1 * rh)) and consists of 7 locations. 14 modules have a trivial ranking function, the largest among these consists of 29 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 53.7s and 20 iterations. TraceHistogramMax:10. Analysis of lassos took 48.6s. Construction of modules took 0.9s. Büchi inclusion checks took 3.9s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 93 StatesRemovedByMinimization, 15 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 [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/6 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 883 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 881 mSDsluCounter, 860 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 640 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1379 IncrementalHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 220 mSDtfsCounter, 1379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc7 concLT0 SILN0 SILU7 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax100 hnf100 lsp87 ukn73 mio100 lsp33 div100 bol100 ite100 ukn100 eq169 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 1 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! [2025-03-09 07:17:33,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:33,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-03-09 07:17:34,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-03-09 07:17:34,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-03-09 07:17:34,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 07:17:34,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 07:17:34,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 07:17:35,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 07:17:35,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 07:17:35,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:35,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 07:17:35,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:36,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE