./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/insertion_sort-1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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/insertion_sort-1-2.c -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 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:02:43,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:02:43,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:02:43,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:02:43,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:02:43,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:02:43,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:02:43,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:02:43,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:02:43,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:02:43,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:02:43,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:02:43,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:02:43,262 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:02:43,262 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:02:43,262 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:02:43,262 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:02:43,262 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:02:43,262 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:02:43,262 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:02:43,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:02:43,263 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:02:43,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:02:43,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:02:43,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:02:43,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:02:43,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:02:43,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:02:43,264 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:02:43,264 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 -> 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 [2025-03-04 16:02:43,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:02:43,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:02:43,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:02:43,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:02:43,572 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:02:43,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1-2.c [2025-03-04 16:02:44,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33892ae2d/a748aa7b28304ac69cc01c541bc42692/FLAG19050cc19 [2025-03-04 16:02:44,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:02:44,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2025-03-04 16:02:45,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33892ae2d/a748aa7b28304ac69cc01c541bc42692/FLAG19050cc19 [2025-03-04 16:02:45,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33892ae2d/a748aa7b28304ac69cc01c541bc42692 [2025-03-04 16:02:45,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:02:45,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:02:45,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:02:45,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:02:45,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:02:45,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e72122f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45, skipping insertion in model container [2025-03-04 16:02:45,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:02:45,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:02:45,468 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:02:45,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:02:45,499 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:02:45,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45 WrapperNode [2025-03-04 16:02:45,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:02:45,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:02:45,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:02:45,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:02:45,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,527 INFO L138 Inliner]: procedures = 15, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-04 16:02:45,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:02:45,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:02:45,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:02:45,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:02:45,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,548 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 16:02:45,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:02:45,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:02:45,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:02:45,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:02:45,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (1/1) ... [2025-03-04 16:02:45,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:45,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:45,595 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-04 16:02:45,598 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-04 16:02:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:02:45,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 16:02:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 16:02:45,663 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:02:45,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:02:45,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: call ULTIMATE.dealloc(main_~#v~0#1.base, main_~#v~0#1.offset);havoc main_~#v~0#1.base, main_~#v~0#1.offset; [2025-03-04 16:02:45,824 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 16:02:45,824 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:02:45,832 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:02:45,832 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:02:45,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:02:45 BoogieIcfgContainer [2025-03-04 16:02:45,834 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:02:45,834 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:02:45,834 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:02:45,838 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:02:45,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:02:45,839 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:02:45" (1/3) ... [2025-03-04 16:02:45,841 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4086e4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:02:45, skipping insertion in model container [2025-03-04 16:02:45,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:02:45,842 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:45" (2/3) ... [2025-03-04 16:02:45,842 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4086e4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:02:45, skipping insertion in model container [2025-03-04 16:02:45,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:02:45,842 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:02:45" (3/3) ... [2025-03-04 16:02:45,844 INFO L363 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1-2.c [2025-03-04 16:02:45,887 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:02:45,887 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:02:45,887 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:02:45,887 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:02:45,887 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:02:45,887 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:02:45,887 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:02:45,887 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:02:45,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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-04 16:02:45,902 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:02:45,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:45,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:45,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:02:45,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:02:45,905 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:02:45,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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-04 16:02:45,907 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:02:45,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:45,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:45,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:02:45,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:02:45,911 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" [2025-03-04 16:02:45,912 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" [2025-03-04 16:02:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash 60541, now seen corresponding path program 1 times [2025-03-04 16:02:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:45,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150071044] [2025-03-04 16:02:45,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:45,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:45,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:45,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:45,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:46,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:46,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:46,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:46,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:46,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:46,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:46,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:46,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 55, now seen corresponding path program 1 times [2025-03-04 16:02:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153084491] [2025-03-04 16:02:46,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:46,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:46,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:46,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:46,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:46,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:46,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:46,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:46,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:46,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:46,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1876795, now seen corresponding path program 1 times [2025-03-04 16:02:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:46,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058848373] [2025-03-04 16:02:46,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:46,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:02:46,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:02:46,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:46,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:46,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:46,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:02:46,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:02:46,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:46,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:46,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:46,421 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:02:46,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:02:46,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:02:46,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:02:46,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:02:46,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:46,423 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:02:46,423 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:02:46,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration1_Lasso [2025-03-04 16:02:46,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:02:46,423 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:02:46,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:46,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:47,024 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:02:47,027 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:02:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:47,030 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-04 16:02:47,032 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-04 16:02:47,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-04 16:02:47,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:47,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:47,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:47,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:47,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:47,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:47,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:47,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:47,062 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-04 16:02:47,064 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-04 16:02:47,066 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-04 16:02:47,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:47,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:47,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:47,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:47,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:47,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:47,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:02:47,117 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 16:02:47,119 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 16:02:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:47,124 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-04 16:02:47,125 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-04 16:02:47,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:02:47,138 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 16:02:47,139 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:02:47,139 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_1, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_1 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~#v~0#1.offset >= 0] [2025-03-04 16:02:47,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:47,167 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 16:02:47,175 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:02:47,176 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:02:47,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:47,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:47,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:47,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 16:02:47,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:47,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:47,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:47,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:47,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 16:02:47,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:47,242 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-04 16:02:47,263 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-04 16:02:47,264 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:47,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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). Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 33 transitions. Complement of second has 3 states. [2025-03-04 16:02:47,304 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-04 16:02:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2025-03-04 16:02:47,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-04 16:02:47,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:47,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-04 16:02:47,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:47,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-04 16:02:47,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:47,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2025-03-04 16:02:47,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-04 16:02:47,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 27 transitions. [2025-03-04 16:02:47,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 16:02:47,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-04 16:02:47,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2025-03-04 16:02:47,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:02:47,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 27 transitions. [2025-03-04 16:02:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2025-03-04 16:02:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-04 16:02:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-04 16:02:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2025-03-04 16:02:47,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2025-03-04 16:02:47,334 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2025-03-04 16:02:47,334 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:02:47,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2025-03-04 16:02:47,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-04 16:02:47,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:47,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:47,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:02:47,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:02:47,337 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" [2025-03-04 16:02:47,337 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume !true;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-03-04 16:02:47,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1876794, now seen corresponding path program 1 times [2025-03-04 16:02:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127212307] [2025-03-04 16:02:47,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:47,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:02:47,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:02:47,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:47,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:02:47,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:02:47,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:47,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash 51596, now seen corresponding path program 1 times [2025-03-04 16:02:47,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754622832] [2025-03-04 16:02:47,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:47,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:47,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:47,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:47,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 16:02:47,416 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-04 16:02:47,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:47,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754622832] [2025-03-04 16:02:47,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754622832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:47,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:02:47,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 16:02:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007627061] [2025-03-04 16:02:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:47,419 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:02:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:47,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 16:02:47,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 16:02:47,421 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 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-04 16:02:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:47,424 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2025-03-04 16:02:47,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2025-03-04 16:02:47,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:47,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2025-03-04 16:02:47,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 16:02:47,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 16:02:47,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2025-03-04 16:02:47,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:02:47,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 16:02:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2025-03-04 16:02:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 16:02:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-03-04 16:02:47,427 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 16:02:47,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 16:02:47,429 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 16:02:47,429 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:02:47,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2025-03-04 16:02:47,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:47,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:47,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:47,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:02:47,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:47,431 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" [2025-03-04 16:02:47,431 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-03-04 16:02:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1876794, now seen corresponding path program 2 times [2025-03-04 16:02:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541734003] [2025-03-04 16:02:47,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:47,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:02:47,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:02:47,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:02:47,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:47,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:02:47,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:02:47,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:47,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash 49560270, now seen corresponding path program 1 times [2025-03-04 16:02:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098862254] [2025-03-04 16:02:47,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:47,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:47,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:47,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:47,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:47,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:47,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:47,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:47,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash 998880053, now seen corresponding path program 1 times [2025-03-04 16:02:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579781076] [2025-03-04 16:02:47,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:47,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:02:47,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:02:47,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:47,620 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-04 16:02:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579781076] [2025-03-04 16:02:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579781076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:02:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:02:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554203049] [2025-03-04 16:02:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:47,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:02:47,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:02:47,744 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:47,762 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2025-03-04 16:02:47,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2025-03-04 16:02:47,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:47,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2025-03-04 16:02:47,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 16:02:47,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 16:02:47,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2025-03-04 16:02:47,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:02:47,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-04 16:02:47,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2025-03-04 16:02:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 16:02:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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-04 16:02:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-04 16:02:47,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-04 16:02:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:02:47,767 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-04 16:02:47,768 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:02:47,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2025-03-04 16:02:47,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:47,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:47,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:47,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:47,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:02:47,769 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~k~0#1 := 1;" [2025-03-04 16:02:47,769 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem12#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem13#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem12#1 <= main_#t~mem13#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~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-04 16:02:47,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash 58180625, now seen corresponding path program 1 times [2025-03-04 16:02:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835022510] [2025-03-04 16:02:47,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:47,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:47,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:47,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:47,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:47,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:47,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 1 times [2025-03-04 16:02:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941362520] [2025-03-04 16:02:47,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:47,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:47,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:47,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:47,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:47,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:47,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:47,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:47,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:47,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1907778316, now seen corresponding path program 1 times [2025-03-04 16:02:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937137248] [2025-03-04 16:02:47,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:47,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:02:47,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:02:47,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:47,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:47,897 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-04 16:02:47,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:47,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937137248] [2025-03-04 16:02:47,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937137248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:47,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:02:47,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:02:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895922502] [2025-03-04 16:02:47,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:47,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:02:47,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:02:47,969 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:47,991 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-04 16:02:47,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2025-03-04 16:02:47,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:47,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 20 transitions. [2025-03-04 16:02:47,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 16:02:47,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 16:02:47,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2025-03-04 16:02:47,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:02:47,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-04 16:02:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2025-03-04 16:02:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 16:02:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-04 16:02:47,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-04 16:02:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 16:02:47,995 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-04 16:02:47,995 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:02:47,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2025-03-04 16:02:47,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:47,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:47,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:47,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:47,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:47,996 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" [2025-03-04 16:02:47,996 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-03-04 16:02:47,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash 58180668, now seen corresponding path program 1 times [2025-03-04 16:02:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:47,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192770375] [2025-03-04 16:02:47,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:47,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:48,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:48,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:48,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:48,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:48,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:48,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash 49560270, now seen corresponding path program 2 times [2025-03-04 16:02:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118915194] [2025-03-04 16:02:48,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:48,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:48,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:02:48,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:48,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:48,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:48,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:48,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1818551155, now seen corresponding path program 1 times [2025-03-04 16:02:48,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:48,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044166224] [2025-03-04 16:02:48,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:02:48,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:02:48,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:48,129 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-04 16:02:48,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:48,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044166224] [2025-03-04 16:02:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044166224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:02:48,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084096787] [2025-03-04 16:02:48,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:48,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:02:48,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:48,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:02:48,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 16:02:48,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:02:48,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:02:48,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:48,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 16:02:48,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:48,208 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-04 16:02:48,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:02:48,247 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-04 16:02:48,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084096787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:02:48,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:02:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 16:02:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019513611] [2025-03-04 16:02:48,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:02:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:48,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 16:02:48,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 16:02:48,350 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-04 16:02:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:48,384 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-03-04 16:02:48,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2025-03-04 16:02:48,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-04 16:02:48,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 34 transitions. [2025-03-04 16:02:48,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-04 16:02:48,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-04 16:02:48,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2025-03-04 16:02:48,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:02:48,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-04 16:02:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2025-03-04 16:02:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-03-04 16:02:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) 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-04 16:02:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-03-04 16:02:48,390 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-04 16:02:48,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 16:02:48,393 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-04 16:02:48,393 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:02:48,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2025-03-04 16:02:48,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:48,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:48,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:48,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:02:48,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:02:48,395 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~k~0#1 := 1;" [2025-03-04 16:02:48,395 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem12#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem13#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem12#1 <= main_#t~mem13#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~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-04 16:02:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1803600719, now seen corresponding path program 1 times [2025-03-04 16:02:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129124351] [2025-03-04 16:02:48,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:02:48,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:02:48,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:48,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:02:48,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:02:48,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:48,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 2 times [2025-03-04 16:02:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:48,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757613403] [2025-03-04 16:02:48,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:48,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:48,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:02:48,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:48,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:48,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:48,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:48,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1028156662, now seen corresponding path program 1 times [2025-03-04 16:02:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824385841] [2025-03-04 16:02:48,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:02:48,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:02:48,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:48,540 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-04 16:02:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824385841] [2025-03-04 16:02:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824385841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:02:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829493032] [2025-03-04 16:02:48,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:02:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:48,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:02:48,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 16:02:48,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:02:48,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:02:48,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:48,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:02:48,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:02:48,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 16:02:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829493032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:48,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 16:02:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 16:02:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766515121] [2025-03-04 16:02:48,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:48,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:02:48,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:02:48,667 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:48,685 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2025-03-04 16:02:48,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2025-03-04 16:02:48,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-04 16:02:48,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 31 transitions. [2025-03-04 16:02:48,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 16:02:48,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-04 16:02:48,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2025-03-04 16:02:48,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:02:48,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-04 16:02:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2025-03-04 16:02:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2025-03-04 16:02:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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-04 16:02:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-04 16:02:48,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-04 16:02:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:02:48,692 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-04 16:02:48,692 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:02:48,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2025-03-04 16:02:48,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:48,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:48,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:48,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-03-04 16:02:48,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:48,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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" [2025-03-04 16:02:48,694 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-04 16:02:48,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash 77048796, now seen corresponding path program 1 times [2025-03-04 16:02:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:48,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886783703] [2025-03-04 16:02:48,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:02:48,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:02:48,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:48,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:02:48,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:02:48,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:48,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:48,711 INFO L85 PathProgramCache]: Analyzing trace with hash 47651632, now seen corresponding path program 1 times [2025-03-04 16:02:48,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:48,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355698946] [2025-03-04 16:02:48,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:48,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:48,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:48,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:48,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:48,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:48,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2029543371, now seen corresponding path program 1 times [2025-03-04 16:02:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:48,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58184004] [2025-03-04 16:02:48,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:48,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:02:48,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:02:48,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:48,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:02:48,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:02:48,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:48,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:48,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:49,140 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:02:49,140 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:02:49,140 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:02:49,140 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:02:49,140 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:02:49,140 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,140 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:02:49,140 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:02:49,140 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration7_Lasso [2025-03-04 16:02:49,140 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:02:49,140 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:02:49,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:49,606 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:02:49,606 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:02:49,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,608 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-04 16:02:49,609 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-04 16:02:49,610 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-04 16:02:49,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 16:02:49,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,632 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-04 16:02:49,634 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-04 16:02:49,635 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-04 16:02:49,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:49,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,660 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-04 16:02:49,661 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-04 16:02:49,662 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-04 16:02:49,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,682 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-04 16:02:49,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,685 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-04 16:02:49,685 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-04 16:02:49,688 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-04 16:02:49,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,707 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-04 16:02:49,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,710 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-04 16:02:49,711 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-04 16:02:49,712 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-04 16:02:49,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:49,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,736 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-04 16:02:49,738 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-04 16:02:49,739 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-04 16:02:49,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:49,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,768 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-04 16:02:49,770 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-04 16:02:49,771 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-04 16:02:49,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,791 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-04 16:02:49,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,793 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:49,805 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-04 16:02:49,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 16:02:49,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 16:02:49,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,830 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:49,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 16:02:49,832 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-04 16:02:49,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:49,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,855 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:49,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 16:02:49,856 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-04 16:02:49,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 16:02:49,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,878 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:49,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 16:02:49,881 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-04 16:02:49,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:49,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 16:02:49,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,904 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:49,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:02:49,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-04 16:02:49,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:49,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:49,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:49,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:49,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:49,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:49,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:02:49,930 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 16:02:49,930 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-04 16:02:49,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:49,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:49,933 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:49,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:02:49,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:02:49,946 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:02:49,946 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:02:49,946 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2025-03-04 16:02:49,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:49,965 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 16:02:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:49,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:02:49,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:02:49,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:49,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:49,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:02:49,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:50,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:50,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:50,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:50,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 16:02:50,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:50,047 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-04 16:02:50,047 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 16:02:50,048 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:50,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 45 transitions. Complement of second has 9 states. [2025-03-04 16:02:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 16:02:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2025-03-04 16:02:50,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 5 letters. [2025-03-04 16:02:50,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:50,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 12 letters. Loop has 5 letters. [2025-03-04 16:02:50,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:50,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 10 letters. [2025-03-04 16:02:50,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:50,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2025-03-04 16:02:50,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:50,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 29 states and 39 transitions. [2025-03-04 16:02:50,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-04 16:02:50,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-04 16:02:50,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2025-03-04 16:02:50,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:50,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-04 16:02:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2025-03-04 16:02:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-03-04 16:02:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 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-04 16:02:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2025-03-04 16:02:50,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-03-04 16:02:50,092 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-03-04 16:02:50,092 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:02:50,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2025-03-04 16:02:50,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:50,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:50,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:50,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:50,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:50,092 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume !main_#t~short9#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2025-03-04 16:02:50,092 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2025-03-04 16:02:50,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1848165398, now seen corresponding path program 1 times [2025-03-04 16:02:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:50,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207571970] [2025-03-04 16:02:50,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:50,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:02:50,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:02:50,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:02:50,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207571970] [2025-03-04 16:02:50,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207571970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:50,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:02:50,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:02:50,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301066987] [2025-03-04 16:02:50,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:50,146 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:02:50,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash 40386600, now seen corresponding path program 3 times [2025-03-04 16:02:50,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:50,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028074444] [2025-03-04 16:02:50,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:02:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:50,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:50,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:50,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:02:50,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:50,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:50,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:50,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:50,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:50,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:02:50,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:02:50,288 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 1.8) 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-04 16:02:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:50,337 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-03-04 16:02:50,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2025-03-04 16:02:50,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-04 16:02:50,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 45 transitions. [2025-03-04 16:02:50,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-04 16:02:50,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-04 16:02:50,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2025-03-04 16:02:50,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:50,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-04 16:02:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2025-03-04 16:02:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2025-03-04 16:02:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 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-04 16:02:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-03-04 16:02:50,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-04 16:02:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:02:50,341 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-04 16:02:50,341 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:02:50,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2025-03-04 16:02:50,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:50,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:50,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:50,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:50,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:50,342 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2025-03-04 16:02:50,343 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2025-03-04 16:02:50,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1848165367, now seen corresponding path program 1 times [2025-03-04 16:02:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412928696] [2025-03-04 16:02:50,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:50,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:02:50,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:02:50,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:50,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:02:50,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:02:50,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:50,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash 40386600, now seen corresponding path program 4 times [2025-03-04 16:02:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:50,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940032765] [2025-03-04 16:02:50,368 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:02:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:50,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-04 16:02:50,373 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:50,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:02:50,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,373 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:50,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:50,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:50,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:50,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1844869646, now seen corresponding path program 2 times [2025-03-04 16:02:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136358634] [2025-03-04 16:02:50,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:50,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 16:02:50,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:02:50,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:02:50,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:50,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 16:02:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:02:50,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:50,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136358634] [2025-03-04 16:02:50,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136358634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:02:50,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985535618] [2025-03-04 16:02:50,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:50,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:02:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:50,493 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-04 16:02:50,495 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-04 16:02:50,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 16:02:50,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:02:50,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:02:50,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:50,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 16:02:50,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:02:50,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:02:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:02:50,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985535618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:02:50,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:02:50,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 16:02:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000864533] [2025-03-04 16:02:50,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:02:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:50,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 16:02:50,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 16:02:50,784 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 14 Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-04 16:02:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:50,854 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2025-03-04 16:02:50,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 69 transitions. [2025-03-04 16:02:50,854 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-04 16:02:50,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 69 transitions. [2025-03-04 16:02:50,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-04 16:02:50,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-03-04 16:02:50,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 69 transitions. [2025-03-04 16:02:50,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:50,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-04 16:02:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 69 transitions. [2025-03-04 16:02:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-03-04 16:02:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 40 states have internal predecessors, (57), 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-04 16:02:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2025-03-04 16:02:50,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-03-04 16:02:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:02:50,861 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-03-04 16:02:50,861 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:02:50,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 57 transitions. [2025-03-04 16:02:50,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:50,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:50,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:50,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:50,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:50,862 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2025-03-04 16:02:50,862 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2025-03-04 16:02:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1488165753, now seen corresponding path program 2 times [2025-03-04 16:02:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:50,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774129861] [2025-03-04 16:02:50,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:50,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 16:02:50,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:02:50,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:02:50,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:50,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:02:50,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:02:50,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:50,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash 40386600, now seen corresponding path program 5 times [2025-03-04 16:02:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391095650] [2025-03-04 16:02:50,891 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:02:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:50,896 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:50,898 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:50,898 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:02:50,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:50,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:50,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:50,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:50,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1837305776, now seen corresponding path program 3 times [2025-03-04 16:02:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:50,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699615596] [2025-03-04 16:02:50,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:02:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:50,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-04 16:02:50,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:02:50,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 16:02:50,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:50,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:02:50,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:02:50,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:50,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:50,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:51,397 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:02:51,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:02:51,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:02:51,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:02:51,398 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:02:51,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:51,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:02:51,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:02:51,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration10_Lasso [2025-03-04 16:02:51,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:02:51,398 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:02:51,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:51,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:52,018 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:02:52,018 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:02:52,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,020 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:52,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:02:52,022 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-04 16:02:52,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:52,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:52,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:52,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:52,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:52,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:52,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:52,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 16:02:52,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,042 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-04 16:02:52,044 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-04 16:02:52,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:02:52,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:52,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:52,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:52,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:52,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:52,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:52,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:52,064 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-04 16:02:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,066 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-04 16:02:52,068 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-04 16:02:52,069 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-04 16:02:52,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:52,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:52,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:52,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:52,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:52,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:52,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:52,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:52,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:52,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,090 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-04 16:02:52,099 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-04 16:02:52,099 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-04 16:02:52,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:52,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:52,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:52,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:52,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:52,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:52,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:52,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:52,116 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-04 16:02:52,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,119 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-04 16:02:52,119 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-04 16:02:52,122 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-04 16:02:52,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:52,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:52,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:52,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:52,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:52,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:52,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:52,142 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-04 16:02:52,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,144 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-04 16:02:52,146 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-04 16:02:52,147 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-04 16:02:52,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:52,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:52,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:52,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:52,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:52,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:52,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:52,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:52,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,170 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-04 16:02:52,171 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-04 16:02:52,172 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-04 16:02:52,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:52,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:52,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:52,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:52,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:52,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:52,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:52,190 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-04 16:02:52,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,192 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-04 16:02:52,194 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-04 16:02:52,195 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-04 16:02:52,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:52,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:52,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:52,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:52,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:52,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:52,228 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:02:52,254 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 16:02:52,254 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 16:02:52,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:52,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:52,259 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-04 16:02:52,260 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-04 16:02:52,261 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:02:52,272 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:02:52,272 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:02:52,272 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_3, ULTIMATE.start_main_~#v~0#1.offset) = -2*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_3 - 1*ULTIMATE.start_main_~#v~0#1.offset Supporting invariants [] [2025-03-04 16:02:52,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:52,292 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-04 16:02:52,294 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2025-03-04 16:02:52,294 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:02:52,294 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:02:52,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:52,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:02:52,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:02:52,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:52,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:52,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:02:52,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:52,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:52,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:52,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:52,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:52,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 16:02:52,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:52,442 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-04 16:02:52,442 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-04 16:02:52,442 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-04 16:02:52,519 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-04 16:02:52,553 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 21. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 75 states and 106 transitions. Complement of second has 13 states. [2025-03-04 16:02:52,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 4 non-accepting loop states 2 accepting loop states [2025-03-04 16:02:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-04 16:02:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2025-03-04 16:02:52,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 11 letters. Loop has 5 letters. [2025-03-04 16:02:52,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:52,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 16 letters. Loop has 5 letters. [2025-03-04 16:02:52,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:52,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 11 letters. Loop has 10 letters. [2025-03-04 16:02:52,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:52,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 106 transitions. [2025-03-04 16:02:52,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-04 16:02:52,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 72 states and 100 transitions. [2025-03-04 16:02:52,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-04 16:02:52,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-04 16:02:52,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 100 transitions. [2025-03-04 16:02:52,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:52,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-03-04 16:02:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 100 transitions. [2025-03-04 16:02:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2025-03-04 16:02:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2025-03-04 16:02:52,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 76 transitions. [2025-03-04 16:02:52,559 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 76 transitions. [2025-03-04 16:02:52,559 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:02:52,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 76 transitions. [2025-03-04 16:02:52,560 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-04 16:02:52,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:52,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:52,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:52,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:02:52,560 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~k~0#1 := 1;" [2025-03-04 16:02:52,560 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem12#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem13#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem12#1 <= main_#t~mem13#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~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-04 16:02:52,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2029542474, now seen corresponding path program 1 times [2025-03-04 16:02:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990288019] [2025-03-04 16:02:52,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:52,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:02:52,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:02:52,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:52,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:52,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:52,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:02:52,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:02:52,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:52,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:52,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:52,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 3 times [2025-03-04 16:02:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:52,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432709012] [2025-03-04 16:02:52,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:02:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:52,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:52,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:52,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:02:52,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:52,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:52,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:52,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:52,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:52,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:52,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:52,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:52,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1845207249, now seen corresponding path program 1 times [2025-03-04 16:02:52,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:52,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785036240] [2025-03-04 16:02:52,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:52,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:02:52,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:02:52,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:52,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:52,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:52,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:02:52,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:02:52,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:52,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:52,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:53,011 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:02:53,011 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:02:53,011 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:02:53,011 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:02:53,011 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:02:53,011 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,011 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:02:53,011 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:02:53,011 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration11_Lasso [2025-03-04 16:02:53,011 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:02:53,011 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:02:53,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:53,421 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:02:53,421 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:02:53,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,423 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-04 16:02:53,425 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-04 16:02:53,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-04 16:02:53,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:53,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,444 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-04 16:02:53,445 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-04 16:02:53,446 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-04 16:02:53,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,462 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-04 16:02:53,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,464 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-04 16:02:53,465 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-04 16:02:53,466 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-04 16:02:53,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,482 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-04 16:02:53,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,484 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-04 16:02:53,485 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-04 16:02:53,485 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-04 16:02:53,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,501 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-04 16:02:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,503 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-04 16:02:53,503 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-04 16:02:53,504 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-04 16:02:53,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,521 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-04 16:02:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,523 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-04 16:02:53,523 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-04 16:02:53,525 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-04 16:02:53,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:53,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,565 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-04 16:02:53,567 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-04 16:02:53,567 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-04 16:02:53,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 16:02:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,585 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-04 16:02:53,586 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-04 16:02:53,587 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-04 16:02:53,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:53,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,607 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-04 16:02:53,608 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-04 16:02:53,609 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-04 16:02:53,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:53,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,628 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:53,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 16:02:53,630 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-04 16:02:53,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-04 16:02:53,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,648 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-04 16:02:53,648 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-04 16:02:53,649 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-04 16:02:53,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:53,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,667 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-04 16:02:53,668 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-04 16:02:53,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:02:53,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,689 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-04 16:02:53,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,692 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-04 16:02:53,693 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-04 16:02:53,694 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-04 16:02:53,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:53,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:53,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:53,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:53,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 16:02:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,713 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-04 16:02:53,713 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-04 16:02:53,714 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-04 16:02:53,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:53,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:53,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:53,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:53,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:53,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:53,738 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:02:53,751 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 16:02:53,751 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-04 16:02:53,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,753 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-04 16:02:53,754 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-04 16:02:53,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:02:53,766 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:02:53,766 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:02:53,766 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~#v~0#1.offset, v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_4) = -4*ULTIMATE.start_main_~k~0#1 - 1*ULTIMATE.start_main_~#v~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_4 Supporting invariants [] [2025-03-04 16:02:53,772 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-04 16:02:53,782 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 16:02:53,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2025-03-04 16:02:53,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:02:53,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:02:53,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:53,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:02:53,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:02:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:53,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:02:53,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:53,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:02:53,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:02:53,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:53,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:53,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:02:53,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:53,829 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-04 16:02:53,830 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-04 16:02:53,830 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 76 transitions. cyclomatic complexity: 29 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-04 16:02:53,838 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 76 transitions. cyclomatic complexity: 29. 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 57 states and 80 transitions. Complement of second has 4 states. [2025-03-04 16:02:53,839 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-04 16:02:53,839 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-04 16:02:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-03-04 16:02:53,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-04 16:02:53,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:53,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 15 letters. Loop has 3 letters. [2025-03-04 16:02:53,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:53,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-04 16:02:53,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:53,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 80 transitions. [2025-03-04 16:02:53,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-04 16:02:53,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 38 states and 52 transitions. [2025-03-04 16:02:53,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-04 16:02:53,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-04 16:02:53,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2025-03-04 16:02:53,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:53,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-04 16:02:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2025-03-04 16:02:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 16:02:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 37 states have internal predecessors, (52), 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-04 16:02:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-03-04 16:02:53,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-04 16:02:53,845 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-04 16:02:53,845 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:02:53,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 52 transitions. [2025-03-04 16:02:53,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-04 16:02:53,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:53,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:53,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:53,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:53,845 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-03-04 16:02:53,845 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume !main_#t~short9#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-03-04 16:02:53,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1111501901, now seen corresponding path program 4 times [2025-03-04 16:02:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000364792] [2025-03-04 16:02:53,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:02:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:53,850 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-03-04 16:02:53,855 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:02:53,855 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:02:53,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:53,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:53,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:02:53,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:02:53,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:53,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:53,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:53,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash 49561231, now seen corresponding path program 1 times [2025-03-04 16:02:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:53,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749198776] [2025-03-04 16:02:53,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:53,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:53,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:53,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:53,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:53,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:53,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:53,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:53,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:53,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:53,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1121905181, now seen corresponding path program 1 times [2025-03-04 16:02:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084321332] [2025-03-04 16:02:53,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:53,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:02:53,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:02:53,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:53,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:53,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:02:53,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084321332] [2025-03-04 16:02:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084321332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:02:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454117501] [2025-03-04 16:02:53,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:53,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:02:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:53,936 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:02:53,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-03-04 16:02:53,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:02:53,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:02:53,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:53,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:53,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 16:02:53,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:02:54,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:02:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:02:54,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454117501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:02:54,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:02:54,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-04 16:02:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874530157] [2025-03-04 16:02:54,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:02:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:54,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 16:02:54,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 16:02:54,078 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. cyclomatic complexity: 19 Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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-04 16:02:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:54,175 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2025-03-04 16:02:54,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 75 transitions. [2025-03-04 16:02:54,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-03-04 16:02:54,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 54 states and 70 transitions. [2025-03-04 16:02:54,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-04 16:02:54,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-03-04 16:02:54,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 70 transitions. [2025-03-04 16:02:54,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:54,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-03-04 16:02:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 70 transitions. [2025-03-04 16:02:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2025-03-04 16:02:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 41 states have internal predecessors, (55), 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-04 16:02:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-03-04 16:02:54,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-03-04 16:02:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 16:02:54,181 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-03-04 16:02:54,182 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 16:02:54,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2025-03-04 16:02:54,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-04 16:02:54,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:54,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:54,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:54,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:54,183 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_~i~0#1 := main_~i~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume !main_#t~short9#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2025-03-04 16:02:54,183 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2025-03-04 16:02:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1810255579, now seen corresponding path program 1 times [2025-03-04 16:02:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744310297] [2025-03-04 16:02:54,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:54,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:02:54,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:02:54,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:54,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:54,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:54,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:02:54,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:02:54,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:54,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:54,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:54,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash 40386600, now seen corresponding path program 6 times [2025-03-04 16:02:54,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:54,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497185628] [2025-03-04 16:02:54,206 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:02:54,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:54,209 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:54,211 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:54,211 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:02:54,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:54,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:54,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:54,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:54,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:54,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:54,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:54,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1539102322, now seen corresponding path program 1 times [2025-03-04 16:02:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:54,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188174547] [2025-03-04 16:02:54,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:54,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:54,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 16:02:54,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 16:02:54,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:54,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:54,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:54,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 16:02:54,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 16:02:54,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:54,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:54,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:55,580 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:02:55,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:02:55,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:02:55,581 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:02:55,581 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:02:55,581 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:55,581 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:02:55,581 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:02:55,581 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration13_Lasso [2025-03-04 16:02:55,581 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:02:55,581 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:02:55,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:55,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:56,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:56,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:56,352 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:02:56,352 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:02:56,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,356 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-04 16:02:56,356 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-04 16:02:56,358 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-04 16:02:56,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:56,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:56,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-04 16:02:56,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,388 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-04 16:02:56,389 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-04 16:02:56,390 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-04 16:02:56,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:56,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:56,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,408 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-04 16:02:56,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,410 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-04 16:02:56,410 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-04 16:02:56,411 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-04 16:02:56,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:56,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,429 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-04 16:02:56,430 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-04 16:02:56,430 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-04 16:02:56,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,447 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-04 16:02:56,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,449 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-04 16:02:56,451 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-04 16:02:56,452 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-04 16:02:56,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,470 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-04 16:02:56,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,473 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-04 16:02:56,474 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-04 16:02:56,474 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-04 16:02:56,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,491 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-04 16:02:56,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,493 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-04 16:02:56,494 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-04 16:02:56,495 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-04 16:02:56,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,517 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-04 16:02:56,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,521 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-04 16:02:56,522 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-04 16:02:56,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-04 16:02:56,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,542 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-04 16:02:56,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,544 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-04 16:02:56,546 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-04 16:02:56,546 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-04 16:02:56,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,566 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-04 16:02:56,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,568 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-04 16:02:56,569 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-04 16:02:56,569 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-04 16:02:56,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 16:02:56,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,588 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-04 16:02:56,590 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-04 16:02:56,590 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-04 16:02:56,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 16:02:56,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,609 INFO L229 MonitoredProcess]: Starting monitored process 57 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-04 16:02:56,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 16:02:56,611 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-04 16:02:56,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 16:02:56,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,631 INFO L229 MonitoredProcess]: Starting monitored process 58 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-04 16:02:56,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 16:02:56,633 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-04 16:02:56,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:56,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:56,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:56,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 16:02:56,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,652 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-04 16:02:56,653 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-04 16:02:56,654 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-04 16:02:56,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:56,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:56,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,673 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-04 16:02:56,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,675 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-04 16:02:56,676 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-04 16:02:56,677 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-04 16:02:56,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:56,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:56,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:56,696 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-04 16:02:56,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,698 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-04 16:02:56,698 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-04 16:02:56,699 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-04 16:02:56,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:56,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:56,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:56,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:56,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:56,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:56,725 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:02:56,738 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 16:02:56,738 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 16:02:56,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:56,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,740 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-04 16:02:56,741 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-04 16:02:56,741 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:02:56,752 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:02:56,752 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:02:56,752 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_5, ULTIMATE.start_main_~#v~0#1.offset) = -4*ULTIMATE.start_main_~j~0#1 + 2*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_5 - 1*ULTIMATE.start_main_~#v~0#1.offset Supporting invariants [] [2025-03-04 16:02:56,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-04 16:02:56,780 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-04 16:02:56,781 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2025-03-04 16:02:56,781 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:02:56,781 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:02:56,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:56,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:02:56,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:02:56,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:56,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:02:56,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:56,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:56,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:56,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:56,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:02:56,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:56,868 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-04 16:02:56,868 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 16:02:56,868 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 55 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:56,884 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 55 transitions. cyclomatic complexity: 17. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 81 transitions. Complement of second has 6 states. [2025-03-04 16:02:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:02:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2025-03-04 16:02:56,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 5 letters. [2025-03-04 16:02:56,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:56,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 21 letters. Loop has 5 letters. [2025-03-04 16:02:56,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:56,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 10 letters. [2025-03-04 16:02:56,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:56,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2025-03-04 16:02:56,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 16:02:56,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 74 transitions. [2025-03-04 16:02:56,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-04 16:02:56,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-04 16:02:56,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2025-03-04 16:02:56,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:56,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 74 transitions. [2025-03-04 16:02:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2025-03-04 16:02:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2025-03-04 16:02:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-04 16:02:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-03-04 16:02:56,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-04 16:02:56,889 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-04 16:02:56,889 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 16:02:56,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2025-03-04 16:02:56,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 16:02:56,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:56,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:56,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:56,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:56,893 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume !(main_~i~0#1 < 2);" [2025-03-04 16:02:56,893 INFO L754 eck$LassoCheckResult]: Loop: "main_~i~0#1 := main_~i~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume !(main_~i~0#1 < 2);" [2025-03-04 16:02:56,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1121904192, now seen corresponding path program 1 times [2025-03-04 16:02:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808433750] [2025-03-04 16:02:56,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:56,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:02:56,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:02:56,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:02:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808433750] [2025-03-04 16:02:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808433750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:02:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742744167] [2025-03-04 16:02:56,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:56,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:02:56,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:56,936 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:02:56,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-03-04 16:02:56,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:02:56,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:02:56,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:56,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:02:56,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:02:57,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:02:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:02:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742744167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:02:57,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:02:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-04 16:02:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543441915] [2025-03-04 16:02:57,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:02:57,023 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:02:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash 41248553, now seen corresponding path program 1 times [2025-03-04 16:02:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:57,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715478259] [2025-03-04 16:02:57,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:57,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:57,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:57,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:57,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:57,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:57,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:57,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:57,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:57,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:57,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:57,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:57,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:57,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:02:57,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:02:57,079 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. cyclomatic complexity: 20 Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:57,125 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2025-03-04 16:02:57,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2025-03-04 16:02:57,126 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-04 16:02:57,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 100 transitions. [2025-03-04 16:02:57,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-04 16:02:57,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-04 16:02:57,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 100 transitions. [2025-03-04 16:02:57,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:57,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 100 transitions. [2025-03-04 16:02:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 100 transitions. [2025-03-04 16:02:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2025-03-04 16:02:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-03-04 16:02:57,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-03-04 16:02:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 16:02:57,133 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-03-04 16:02:57,133 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 16:02:57,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 79 transitions. [2025-03-04 16:02:57,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:57,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:57,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:57,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:57,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:57,135 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_~i~0#1 := main_~i~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" [2025-03-04 16:02:57,135 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_~i~0#1 := main_~i~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" [2025-03-04 16:02:57,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash -787730260, now seen corresponding path program 1 times [2025-03-04 16:02:57,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:57,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580355524] [2025-03-04 16:02:57,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:57,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:57,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:02:57,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:02:57,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:57,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:57,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:57,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:02:57,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:02:57,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:57,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:57,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:57,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash 43835692, now seen corresponding path program 2 times [2025-03-04 16:02:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:57,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735779833] [2025-03-04 16:02:57,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:57,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:57,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:57,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:02:57,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:57,165 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:57,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:57,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:57,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:57,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:57,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:57,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:57,167 INFO L85 PathProgramCache]: Analyzing trace with hash 91972449, now seen corresponding path program 2 times [2025-03-04 16:02:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:57,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425023137] [2025-03-04 16:02:57,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:57,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 16:02:57,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:02:57,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:02:57,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 16:02:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425023137] [2025-03-04 16:02:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425023137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:02:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690477772] [2025-03-04 16:02:57,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:57,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:02:57,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:57,237 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:02:57,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-03-04 16:02:57,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 16:02:57,306 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-04 16:02:57,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:02:57,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:02:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:57,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 16:02:57,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:02:57,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:02:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:02:57,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690477772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:02:57,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:02:57,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 7 [2025-03-04 16:02:57,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161160009] [2025-03-04 16:02:57,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:02:57,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:57,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 16:02:57,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 16:02:57,477 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. cyclomatic complexity: 22 Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:57,577 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2025-03-04 16:02:57,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 110 transitions. [2025-03-04 16:02:57,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:02:57,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 71 states and 82 transitions. [2025-03-04 16:02:57,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-04 16:02:57,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-04 16:02:57,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 82 transitions. [2025-03-04 16:02:57,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:57,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-03-04 16:02:57,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 82 transitions. [2025-03-04 16:02:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2025-03-04 16:02:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.196078431372549) internal successors, (61), 50 states have internal predecessors, (61), 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-04 16:02:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-04 16:02:57,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-04 16:02:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 16:02:57,583 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-04 16:02:57,583 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 16:02:57,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 61 transitions. [2025-03-04 16:02:57,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:02:57,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:57,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:57,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 16:02:57,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:57,584 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" [2025-03-04 16:02:57,584 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume !(main_~i~0#1 < 2);" "main_~i~0#1 := main_~i~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" [2025-03-04 16:02:57,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 113164826, now seen corresponding path program 5 times [2025-03-04 16:02:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:57,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022582898] [2025-03-04 16:02:57,586 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:02:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:57,590 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-03-04 16:02:57,599 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 16:02:57,600 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 16:02:57,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:02:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022582898] [2025-03-04 16:02:57,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022582898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:02:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042509522] [2025-03-04 16:02:57,864 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:02:57,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:02:57,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:57,866 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:02:57,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-03-04 16:02:57,912 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-03-04 16:02:57,937 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 16:02:57,937 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 16:02:57,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:57,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 16:02:57,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:02:58,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:02:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:02:58,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042509522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:02:58,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:02:58,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2025-03-04 16:02:58,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87918143] [2025-03-04 16:02:58,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:02:58,158 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:02:58,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash 45744023, now seen corresponding path program 2 times [2025-03-04 16:02:58,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:58,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685284781] [2025-03-04 16:02:58,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:58,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:58,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:58,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:02:58,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:58,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:58,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:58,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:58,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:58,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:58,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:58,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 16:02:58,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-04 16:02:58,207 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. cyclomatic complexity: 13 Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 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-04 16:02:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:58,400 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2025-03-04 16:02:58,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 139 transitions. [2025-03-04 16:02:58,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:02:58,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 91 states and 109 transitions. [2025-03-04 16:02:58,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-04 16:02:58,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-04 16:02:58,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 109 transitions. [2025-03-04 16:02:58,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:58,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-03-04 16:02:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 109 transitions. [2025-03-04 16:02:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52. [2025-03-04 16:02:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 51 states have internal predecessors, (62), 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-04 16:02:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-04 16:02:58,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-04 16:02:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 16:02:58,408 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-04 16:02:58,408 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-04 16:02:58,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 62 transitions. [2025-03-04 16:02:58,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:02:58,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:58,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:58,408 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 16:02:58,408 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:02:58,408 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(21, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296;call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" [2025-03-04 16:02:58,408 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1;" "assume main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume !(main_~i~0#1 < 2);" "main_~i~0#1 := main_~i~0#1 - 1;" "assume true;main_#t~short9#1 := main_~i~0#1 >= 0;" [2025-03-04 16:02:58,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash 314653912, now seen corresponding path program 6 times [2025-03-04 16:02:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:58,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907963800] [2025-03-04 16:02:58,409 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:02:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:58,416 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-04 16:02:58,432 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:02:58,432 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 16:02:58,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:58,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:58,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:02:58,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:02:58,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:58,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:58,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash 45744023, now seen corresponding path program 3 times [2025-03-04 16:02:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541737799] [2025-03-04 16:02:58,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:02:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:58,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:58,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:58,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:02:58,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:58,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:58,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:02:58,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:02:58,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:58,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:58,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:58,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1379938592, now seen corresponding path program 1 times [2025-03-04 16:02:58,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:58,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975289390] [2025-03-04 16:02:58,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:58,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:02:58,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:02:58,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:58,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:58,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:58,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:02:58,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:02:58,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:58,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:58,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:00,622 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:03:00,622 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:03:00,622 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:03:00,622 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:03:00,622 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:03:00,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:00,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:03:00,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:03:00,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration17_Lasso [2025-03-04 16:03:00,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:03:00,622 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:03:00,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:00,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:01,042 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:03:01,043 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:03:01,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,045 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-04 16:03:01,045 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-04 16:03:01,046 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-04 16:03:01,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 16:03:01,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,066 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-04 16:03:01,067 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-04 16:03:01,068 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-04 16:03:01,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:01,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:01,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:01,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,084 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-04 16:03:01,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,086 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-04 16:03:01,087 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-04 16:03:01,088 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-04 16:03:01,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-04 16:03:01,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,108 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-04 16:03:01,108 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-04 16:03:01,109 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-04 16:03:01,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 16:03:01,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,129 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-04 16:03:01,130 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-04 16:03:01,131 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-04 16:03:01,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:01,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:01,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:01,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,147 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-04 16:03:01,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,149 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-04 16:03:01,149 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-04 16:03:01,151 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-04 16:03:01,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,169 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-04 16:03:01,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,171 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-04 16:03:01,172 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-04 16:03:01,173 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-04 16:03:01,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,196 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-04 16:03:01,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,198 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-04 16:03:01,198 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-04 16:03:01,199 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-04 16:03:01,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 16:03:01,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,221 INFO L229 MonitoredProcess]: Starting monitored process 74 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-04 16:03:01,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 16:03:01,223 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-04 16:03:01,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-04 16:03:01,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,244 INFO L229 MonitoredProcess]: Starting monitored process 75 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-04 16:03:01,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 16:03:01,246 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-04 16:03:01,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-04 16:03:01,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,266 INFO L229 MonitoredProcess]: Starting monitored process 76 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-04 16:03:01,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-04 16:03:01,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:01,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:01,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-04 16:03:01,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,288 INFO L229 MonitoredProcess]: Starting monitored process 77 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-04 16:03:01,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-04 16:03:01,289 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-04 16:03:01,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:01,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:01,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:01,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:01,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:01,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:01,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:03:01,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:03:01,315 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 16:03:01,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:01,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:01,317 INFO L229 MonitoredProcess]: Starting monitored process 78 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-04 16:03:01,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-04 16:03:01,318 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:03:01,328 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:03:01,329 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:03:01,329 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-04 16:03:01,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-04 16:03:01,349 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 16:03:01,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:01,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:03:01,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:03:01,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:01,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:01,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:03:01,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:01,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:01,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:01,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:01,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:01,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:03:01,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:01,409 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-04 16:03:01,409 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 16:03:01,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:01,422 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 13. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 71 transitions. Complement of second has 5 states. [2025-03-04 16:03:01,423 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-04 16:03:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 16:03:01,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 20 letters. Loop has 5 letters. [2025-03-04 16:03:01,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:01,424 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:03:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:01,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:03:01,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:03:01,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:01,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:01,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:03:01,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:01,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:01,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:01,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:01,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:01,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:03:01,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:01,479 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-04 16:03:01,479 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 16:03:01,480 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:01,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 13. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 71 transitions. Complement of second has 5 states. [2025-03-04 16:03:01,494 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-04 16:03:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 16:03:01,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 20 letters. Loop has 5 letters. [2025-03-04 16:03:01,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:01,495 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:03:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:01,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:03:01,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:03:01,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:01,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:01,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:03:01,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:01,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:01,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:01,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:01,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:01,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:03:01,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:01,560 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-04 16:03:01,561 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 16:03:01,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:01,585 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 13. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 86 states and 106 transitions. Complement of second has 9 states. [2025-03-04 16:03:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:03:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-03-04 16:03:01,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 20 letters. Loop has 5 letters. [2025-03-04 16:03:01,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:01,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 5 letters. [2025-03-04 16:03:01,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:01,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 20 letters. Loop has 10 letters. [2025-03-04 16:03:01,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:01,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 106 transitions. [2025-03-04 16:03:01,588 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:03:01,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2025-03-04 16:03:01,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:03:01,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:03:01,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:03:01,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:03:01,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:03:01,588 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:03:01,588 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:03:01,588 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-04 16:03:01,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:03:01,588 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:03:01,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:03:01,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:03:01 BoogieIcfgContainer [2025-03-04 16:03:01,598 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:03:01,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:03:01,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:03:01,599 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:03:01,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:02:45" (3/4) ... [2025-03-04 16:03:01,601 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:03:01,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:03:01,602 INFO L158 Benchmark]: Toolchain (without parser) took 16264.39ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.4MB in the beginning and 72.6MB in the end (delta: 40.8MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2025-03-04 16:03:01,602 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:03:01,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.83ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 102.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:03:01,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.54ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 100.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:03:01,602 INFO L158 Benchmark]: Boogie Preprocessor took 33.84ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.5MB in the end (delta: 986.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:03:01,602 INFO L158 Benchmark]: IcfgBuilder took 271.17ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 85.7MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:03:01,603 INFO L158 Benchmark]: BuchiAutomizer took 15764.01ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 85.3MB in the beginning and 72.6MB in the end (delta: 12.7MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2025-03-04 16:03:01,603 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 218.1MB. Free memory was 72.6MB in the beginning and 72.6MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:03:01,604 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.17ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.83ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 102.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.54ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 100.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.84ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.5MB in the end (delta: 986.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 271.17ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 85.7MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 15764.01ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 85.3MB in the beginning and 72.6MB in the end (delta: 12.7MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 218.1MB. Free memory was 72.6MB in the beginning and 72.6MB in the end (delta: 42.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: ~#v~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#v~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#v~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 17 terminating modules (11 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function (((long long) 2 * i) + 1) and consists of 5 locations. One deterministic module has affine ranking function null and consists of 8 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 18 iterations. TraceHistogramMax:4. Analysis of lassos took 13.9s. Construction of modules took 0.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 150 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 477 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 471 mSDsluCounter, 871 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 610 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 820 IncrementalHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 261 mSDtfsCounter, 820 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc7 concLT0 SILN0 SILU3 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax100 hnf100 lsp93 ukn65 mio100 lsp40 div331 bol100 ite100 ukn100 eq141 hnf95 smp48 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 2 VariablesLoop: 0 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-04 16:03:01,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-04 16:03:01,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:02,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-03-04 16:03:02,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-03-04 16:03:02,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:02,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:02,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:03,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 16:03:03,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE