./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 14:25:00,009 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 14:25:00,048 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2025-02-08 14:25:00,052 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 14:25:00,052 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 14:25:00,052 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG
[2025-02-08 14:25:00,070 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 14:25:00,071 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 14:25:00,071 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 14:25:00,071 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-08 14:25:00,071 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-08 14:25:00,072 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 14:25:00,072 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 14:25:00,072 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 14:25:00,072 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-02-08 14:25:00,072 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-02-08 14:25:00,072 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-02-08 14:25:00,072 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-02-08 14:25:00,072 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-02-08 14:25:00,072 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-02-08 14:25:00,072 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 14:25:00,072 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 14:25:00,073 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 14:25:00,073 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 14:25:00,074 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 14:25:00,074 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 14:25:00,074 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 14:25:00,074 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-02-08 14:25:00,074 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-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1
[2025-02-08 14:25:00,297 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 14:25:00,304 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 14:25:00,305 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 14:25:00,306 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 14:25:00,306 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 14:25:00,308 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i
[2025-02-08 14:25:01,477 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/352fb5ee9/6d8008f6ba054b39a772cdf9a6c00374/FLAGbc7d622a5
[2025-02-08 14:25:01,793 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 14:25:01,793 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i
[2025-02-08 14:25:01,801 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/352fb5ee9/6d8008f6ba054b39a772cdf9a6c00374/FLAGbc7d622a5
[2025-02-08 14:25:01,811 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/352fb5ee9/6d8008f6ba054b39a772cdf9a6c00374
[2025-02-08 14:25:01,813 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 14:25:01,814 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 14:25:01,815 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 14:25:01,815 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 14:25:01,818 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 14:25:01,818 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:25:01" (1/1) ...
[2025-02-08 14:25:01,819 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33553f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:01, skipping insertion in model container
[2025-02-08 14:25:01,819 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:25:01" (1/1) ...
[2025-02-08 14:25:01,836 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 14:25:01,988 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 14:25:01,995 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 14:25:02,019 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 14:25:02,042 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 14:25:02,043 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02 WrapperNode
[2025-02-08 14:25:02,043 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 14:25:02,044 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 14:25:02,044 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 14:25:02,044 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 14:25:02,048 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,055 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,065 INFO  L138                Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56
[2025-02-08 14:25:02,066 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 14:25:02,066 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 14:25:02,066 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 14:25:02,067 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 14:25:02,071 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,072 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,073 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,080 INFO  L175           MemorySlicer]: Split 14 memory accesses to 3 slices as follows [4, 6, 4]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [2, 3, 2].
[2025-02-08 14:25:02,081 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,081 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,084 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,084 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,085 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,085 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,086 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 14:25:02,087 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 14:25:02,087 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 14:25:02,087 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 14:25:02,087 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (1/1) ...
[2025-02-08 14:25:02,091 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:02,100 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:02,111 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:02,113 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2025-02-08 14:25:02,129 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-08 14:25:02,129 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-08 14:25:02,130 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-02-08 14:25:02,130 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-08 14:25:02,130 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-08 14:25:02,130 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-02-08 14:25:02,130 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-02-08 14:25:02,130 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-08 14:25:02,130 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 14:25:02,130 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 14:25:02,193 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 14:25:02,194 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 14:25:02,278 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L558: havoc main_#t~mem12#1;call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call ULTIMATE.dealloc(main_#t~malloc4#1.base, main_#t~malloc4#1.offset);havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset;
[2025-02-08 14:25:02,284 INFO  L?                        ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2025-02-08 14:25:02,284 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 14:25:02,290 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 14:25:02,290 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 14:25:02,291 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:02 BoogieIcfgContainer
[2025-02-08 14:25:02,291 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 14:25:02,291 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-02-08 14:25:02,291 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-02-08 14:25:02,296 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-02-08 14:25:02,296 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:25:02,296 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:25:01" (1/3) ...
[2025-02-08 14:25:02,297 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a356be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:25:02, skipping insertion in model container
[2025-02-08 14:25:02,297 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:25:02,298 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:02" (2/3) ...
[2025-02-08 14:25:02,298 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a356be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:25:02, skipping insertion in model container
[2025-02-08 14:25:02,298 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:25:02,298 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:02" (3/3) ...
[2025-02-08 14:25:02,299 INFO  L363   chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i
[2025-02-08 14:25:02,332 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-02-08 14:25:02,332 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-02-08 14:25:02,332 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-02-08 14:25:02,332 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-02-08 14:25:02,332 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-02-08 14:25:02,332 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-02-08 14:25:02,332 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-02-08 14:25:02,332 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-02-08 14:25:02,336 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:02,345 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-08 14:25:02,345 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:02,345 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:02,348 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:25:02,348 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-02-08 14:25:02,348 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-02-08 14:25:02,349 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:02,349 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-08 14:25:02,349 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:02,349 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:02,349 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:25:02,350 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-02-08 14:25:02,353 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-02-08 14:25:02,353 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !true;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-02-08 14:25:02,357 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:02,358 INFO  L85        PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times
[2025-02-08 14:25:02,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:02,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930228011]
[2025-02-08 14:25:02,363 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:02,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:02,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:02,441 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:02,442 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:02,442 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:02,442 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:02,445 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:02,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:02,454 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:02,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:02,469 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:02,471 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:02,471 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384154, now seen corresponding path program 1 times
[2025-02-08 14:25:02,471 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:02,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821207566]
[2025-02-08 14:25:02,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:02,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:02,482 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-08 14:25:02,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-08 14:25:02,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:02,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:02,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:02,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:02,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821207566]
[2025-02-08 14:25:02,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821207566] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:25:02,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:25:02,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 14:25:02,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75264572]
[2025-02-08 14:25:02,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:25:02,543 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:25:02,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:02,563 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-08 14:25:02,563 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-08 14:25:02,564 INFO  L87              Difference]: Start difference. First operand  has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-02-08 14:25:02,569 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:02,569 INFO  L93              Difference]: Finished difference Result 10 states and 11 transitions.
[2025-02-08 14:25:02,570 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions.
[2025-02-08 14:25:02,571 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-08 14:25:02,574 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 6 states and 7 transitions.
[2025-02-08 14:25:02,576 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 6
[2025-02-08 14:25:02,576 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 6
[2025-02-08 14:25:02,577 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions.
[2025-02-08 14:25:02,577 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:25:02,578 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions.
[2025-02-08 14:25:02,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions.
[2025-02-08 14:25:02,593 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6.
[2025-02-08 14:25:02,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:02,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions.
[2025-02-08 14:25:02,597 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions.
[2025-02-08 14:25:02,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-08 14:25:02,600 INFO  L432   stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions.
[2025-02-08 14:25:02,601 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-02-08 14:25:02,601 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions.
[2025-02-08 14:25:02,602 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-08 14:25:02,602 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:02,602 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:02,602 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:25:02,602 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1]
[2025-02-08 14:25:02,603 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-02-08 14:25:02,603 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-02-08 14:25:02,603 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:02,604 INFO  L85        PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 2 times
[2025-02-08 14:25:02,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:02,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910826676]
[2025-02-08 14:25:02,605 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:02,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:02,623 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:02,641 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:02,641 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:02,641 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:02,641 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:02,649 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:02,660 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:02,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:02,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:02,668 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:02,670 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:02,670 INFO  L85        PathProgramCache]: Analyzing trace with hash 42907910, now seen corresponding path program 1 times
[2025-02-08 14:25:02,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:02,670 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509506700]
[2025-02-08 14:25:02,670 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:02,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:02,681 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-02-08 14:25:02,687 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-02-08 14:25:02,689 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:02,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:02,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:02,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:02,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509506700]
[2025-02-08 14:25:02,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509506700] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:25:02,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:25:02,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 14:25:02,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921525023]
[2025-02-08 14:25:02,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:25:02,802 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:25:02,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:02,803 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 14:25:02,803 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 14:25:02,803 INFO  L87              Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand  has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-02-08 14:25:02,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:02,828 INFO  L93              Difference]: Finished difference Result 8 states and 9 transitions.
[2025-02-08 14:25:02,828 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions.
[2025-02-08 14:25:02,828 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:02,829 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions.
[2025-02-08 14:25:02,829 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 8
[2025-02-08 14:25:02,829 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 8
[2025-02-08 14:25:02,829 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions.
[2025-02-08 14:25:02,829 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:25:02,829 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions.
[2025-02-08 14:25:02,829 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions.
[2025-02-08 14:25:02,830 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8.
[2025-02-08 14:25:02,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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-02-08 14:25:02,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions.
[2025-02-08 14:25:02,830 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions.
[2025-02-08 14:25:02,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 14:25:02,831 INFO  L432   stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions.
[2025-02-08 14:25:02,831 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-02-08 14:25:02,831 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions.
[2025-02-08 14:25:02,831 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:02,831 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:02,831 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:02,832 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:25:02,832 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1]
[2025-02-08 14:25:02,832 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-02-08 14:25:02,832 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-02-08 14:25:02,833 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:02,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 3 times
[2025-02-08 14:25:02,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:02,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755472770]
[2025-02-08 14:25:02,833 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:25:02,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:02,842 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:02,853 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:02,853 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-08 14:25:02,853 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:02,853 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:02,855 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:02,860 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:02,860 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:02,860 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:02,862 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:02,862 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:02,862 INFO  L85        PathProgramCache]: Analyzing trace with hash -1715136633, now seen corresponding path program 1 times
[2025-02-08 14:25:02,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:02,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323778600]
[2025-02-08 14:25:02,863 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:02,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:02,869 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:02,873 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:02,873 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:02,873 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:03,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:03,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:03,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323778600]
[2025-02-08 14:25:03,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323778600] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 14:25:03,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564110436]
[2025-02-08 14:25:03,060 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:03,060 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:03,060 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:03,067 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:03,068 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-08 14:25:03,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:03,127 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:03,127 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:03,127 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:03,133 INFO  L256         TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:03,139 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:03,191 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2025-02-08 14:25:03,203 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2025-02-08 14:25:03,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:03,220 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 14:25:03,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:03,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564110436] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 14:25:03,254 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 14:25:03,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10
[2025-02-08 14:25:03,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238199554]
[2025-02-08 14:25:03,254 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 14:25:03,255 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:25:03,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:03,255 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-08 14:25:03,255 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-02-08 14:25:03,255 INFO  L87              Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand  has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:03,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:03,318 INFO  L93              Difference]: Finished difference Result 14 states and 15 transitions.
[2025-02-08 14:25:03,318 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions.
[2025-02-08 14:25:03,319 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2025-02-08 14:25:03,319 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions.
[2025-02-08 14:25:03,319 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 14
[2025-02-08 14:25:03,319 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 14
[2025-02-08 14:25:03,319 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions.
[2025-02-08 14:25:03,319 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:25:03,319 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions.
[2025-02-08 14:25:03,319 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions.
[2025-02-08 14:25:03,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2025-02-08 14:25:03,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:03,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions.
[2025-02-08 14:25:03,320 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions.
[2025-02-08 14:25:03,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-08 14:25:03,323 INFO  L432   stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions.
[2025-02-08 14:25:03,323 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-02-08 14:25:03,323 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions.
[2025-02-08 14:25:03,323 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2025-02-08 14:25:03,323 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:03,323 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:03,324 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:25:03,324 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1]
[2025-02-08 14:25:03,324 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-02-08 14:25:03,324 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-02-08 14:25:03,324 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:03,324 INFO  L85        PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 4 times
[2025-02-08 14:25:03,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:03,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904723927]
[2025-02-08 14:25:03,324 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 14:25:03,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:03,335 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes.
[2025-02-08 14:25:03,348 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:03,348 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 14:25:03,348 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:03,348 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:03,350 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:03,356 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:03,360 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:03,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:03,362 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:03,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:03,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -2058696310, now seen corresponding path program 2 times
[2025-02-08 14:25:03,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:03,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104615796]
[2025-02-08 14:25:03,363 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:03,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:03,377 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes.
[2025-02-08 14:25:03,389 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-08 14:25:03,390 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-08 14:25:03,390 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:03,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:03,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:03,847 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104615796]
[2025-02-08 14:25:03,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104615796] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 14:25:03,847 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693658371]
[2025-02-08 14:25:03,847 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:03,847 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:03,847 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:03,850 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:03,851 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-08 14:25:03,898 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes.
[2025-02-08 14:25:03,928 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-08 14:25:03,928 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-08 14:25:03,928 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:03,929 INFO  L256         TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:03,931 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:03,934 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2025-02-08 14:25:03,942 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2025-02-08 14:25:03,956 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2025-02-08 14:25:03,979 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2025-02-08 14:25:03,997 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2025-02-08 14:25:04,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:04,012 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 14:25:04,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:04,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [693658371] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 14:25:04,121 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 14:25:04,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20
[2025-02-08 14:25:04,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476962297]
[2025-02-08 14:25:04,121 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 14:25:04,122 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:25:04,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:04,122 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-02-08 14:25:04,123 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380
[2025-02-08 14:25:04,123 INFO  L87              Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 2 Second operand  has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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-02-08 14:25:04,297 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:04,297 INFO  L93              Difference]: Finished difference Result 24 states and 25 transitions.
[2025-02-08 14:25:04,298 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions.
[2025-02-08 14:25:04,298 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2025-02-08 14:25:04,299 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions.
[2025-02-08 14:25:04,299 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 24
[2025-02-08 14:25:04,299 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2025-02-08 14:25:04,299 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions.
[2025-02-08 14:25:04,299 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:25:04,299 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 24 states and 25 transitions.
[2025-02-08 14:25:04,299 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions.
[2025-02-08 14:25:04,300 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2025-02-08 14:25:04,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 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-02-08 14:25:04,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions.
[2025-02-08 14:25:04,300 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 24 states and 25 transitions.
[2025-02-08 14:25:04,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-08 14:25:04,301 INFO  L432   stractBuchiCegarLoop]: Abstraction has 24 states and 25 transitions.
[2025-02-08 14:25:04,301 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-02-08 14:25:04,301 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions.
[2025-02-08 14:25:04,302 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2025-02-08 14:25:04,302 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:04,302 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:04,302 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:25:04,302 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1]
[2025-02-08 14:25:04,302 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-02-08 14:25:04,302 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-02-08 14:25:04,302 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:04,303 INFO  L85        PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 5 times
[2025-02-08 14:25:04,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:04,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232841670]
[2025-02-08 14:25:04,303 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 14:25:04,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:04,308 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:04,315 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:04,315 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:04,315 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:04,315 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:04,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:04,323 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:04,324 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:04,324 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:04,348 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:04,349 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:04,349 INFO  L85        PathProgramCache]: Analyzing trace with hash -1231859057, now seen corresponding path program 3 times
[2025-02-08 14:25:04,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:04,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480831029]
[2025-02-08 14:25:04,349 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:25:04,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:04,359 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 10 equivalence classes.
[2025-02-08 14:25:04,397 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-08 14:25:04,397 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s)
[2025-02-08 14:25:04,397 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:04,397 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:04,400 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-02-08 14:25:04,409 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-08 14:25:04,409 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:04,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:04,417 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:04,418 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:04,418 INFO  L85        PathProgramCache]: Analyzing trace with hash -86209152, now seen corresponding path program 1 times
[2025-02-08 14:25:04,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:04,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934659279]
[2025-02-08 14:25:04,418 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:04,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:04,429 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-02-08 14:25:04,442 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-02-08 14:25:04,442 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:04,442 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:04,442 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:04,445 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-02-08 14:25:04,455 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-02-08 14:25:04,455 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:04,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:04,459 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:15,726 WARN  L286               SmtUtils]: Spent 11.26s on a formula simplification. DAG size of input: 209 DAG size of output: 198 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2025-02-08 14:25:16,073 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-08 14:25:16,074 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-08 14:25:16,075 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-08 14:25:16,075 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-08 14:25:16,075 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-08 14:25:16,075 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:16,075 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-08 14:25:16,075 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-08 14:25:16,075 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration5_Lasso
[2025-02-08 14:25:16,076 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-08 14:25:16,078 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-08 14:25:16,095 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,102 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,104 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,485 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,487 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,490 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,492 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,496 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,498 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,500 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,501 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,504 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,505 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:16,833 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-08 14:25:16,836 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-08 14:25:16,837 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:16,838 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:16,841 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:16,842 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2025-02-08 14:25:16,844 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-02-08 14:25:16,859 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:16,859 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:16,860 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:16,860 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:16,860 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:16,864 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:16,864 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:16,866 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:16,873 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:16,874 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:16,874 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:16,876 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:16,880 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2025-02-08 14:25:16,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-02-08 14:25:16,895 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:16,895 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:16,895 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:16,895 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:16,895 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:16,898 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:16,898 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:16,900 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:16,910 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2025-02-08 14:25:16,910 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:16,910 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:16,912 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:16,913 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2025-02-08 14:25:16,914 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-02-08 14:25:16,923 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:16,924 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:16,924 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:16,924 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:16,928 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:16,928 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:16,933 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:16,939 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2025-02-08 14:25:16,939 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:16,939 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:16,942 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:16,942 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2025-02-08 14:25:16,943 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-02-08 14:25:16,953 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:16,953 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:16,953 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:16,953 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:16,956 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:16,956 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:16,960 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:16,966 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2025-02-08 14:25:16,967 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:16,967 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:16,969 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:16,974 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2025-02-08 14:25:16,975 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-02-08 14:25:16,984 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:16,985 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:16,985 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:16,985 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:16,986 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:16,986 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:16,989 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:16,998 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2025-02-08 14:25:16,998 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:16,998 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:17,003 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:17,004 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2025-02-08 14:25:17,004 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-02-08 14:25:17,014 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:17,015 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:17,015 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:17,015 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:17,018 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:17,018 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:17,022 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:17,029 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0
[2025-02-08 14:25:17,029 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:17,029 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:17,031 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:17,033 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process
[2025-02-08 14:25:17,034 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-02-08 14:25:17,044 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:17,044 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:17,044 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:17,044 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:17,048 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:17,048 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:17,053 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:17,061 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2025-02-08 14:25:17,061 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:17,062 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:17,064 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:17,065 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process
[2025-02-08 14:25:17,067 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-02-08 14:25:17,077 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:17,077 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:17,077 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:17,077 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:17,081 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:17,081 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:17,085 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:17,091 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2025-02-08 14:25:17,092 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:17,092 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:17,093 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:17,095 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process
[2025-02-08 14:25:17,096 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-02-08 14:25:17,107 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:17,107 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:17,107 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:17,107 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:17,110 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:17,110 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:17,116 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-08 14:25:17,132 INFO  L443   ModelExtractionUtils]: Simplification made 8 calls to the SMT solver.
[2025-02-08 14:25:17,134 INFO  L444   ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero.
[2025-02-08 14:25:17,137 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:17,137 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:17,140 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:17,145 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process
[2025-02-08 14:25:17,145 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-08 14:25:17,157 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-08 14:25:17,157 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-08 14:25:17,158 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) 0)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) 0)_1 + 19
Supporting invariants []
[2025-02-08 14:25:17,163 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0
[2025-02-08 14:25:17,303 INFO  L156   tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed
[2025-02-08 14:25:17,305 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:17,314 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2025-02-08 14:25:17,315 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2025-02-08 14:25:17,315 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,<LOCAL,main>]]]
[2025-02-08 14:25:17,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:17,405 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:25:17,431 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:25:17,431 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,431 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:17,434 INFO  L256         TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:17,435 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:17,482 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-02-08 14:25:17,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-08 14:25:17,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:17,510 INFO  L256         TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:17,511 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:17,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-02-08 14:25:17,648 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-02-08 14:25:17,648 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 25 transitions. cyclomatic complexity: 2 Second operand  has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:17,707 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 25 transitions. cyclomatic complexity: 2. Second operand  has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 50 transitions. Complement of second has 6 states.
[2025-02-08 14:25:17,708 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-02-08 14:25:17,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:17,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions.
[2025-02-08 14:25:17,713 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 1 letters. Loop has 23 letters.
[2025-02-08 14:25:17,714 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:17,714 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 24 letters. Loop has 23 letters.
[2025-02-08 14:25:17,714 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:17,715 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 1 letters. Loop has 46 letters.
[2025-02-08 14:25:17,716 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:17,716 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 50 transitions.
[2025-02-08 14:25:17,717 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-08 14:25:17,717 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 46 states and 49 transitions.
[2025-02-08 14:25:17,717 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 22
[2025-02-08 14:25:17,717 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 23
[2025-02-08 14:25:17,719 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 46 states and 49 transitions.
[2025-02-08 14:25:17,720 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-08 14:25:17,720 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 46 states and 49 transitions.
[2025-02-08 14:25:17,720 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46 states and 49 transitions.
[2025-02-08 14:25:17,720 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28.
[2025-02-08 14:25:17,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 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-02-08 14:25:17,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions.
[2025-02-08 14:25:17,721 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions.
[2025-02-08 14:25:17,721 INFO  L432   stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions.
[2025-02-08 14:25:17,721 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-02-08 14:25:17,721 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions.
[2025-02-08 14:25:17,721 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-08 14:25:17,721 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:17,721 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:17,722 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-08 14:25:17,722 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-02-08 14:25:17,722 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" 
[2025-02-08 14:25:17,722 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-02-08 14:25:17,722 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:17,722 INFO  L85        PathProgramCache]: Analyzing trace with hash 46607, now seen corresponding path program 1 times
[2025-02-08 14:25:17,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:17,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423929614]
[2025-02-08 14:25:17,722 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:17,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:17,733 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-08 14:25:17,744 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-08 14:25:17,746 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,746 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,746 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:17,748 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-08 14:25:17,751 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-08 14:25:17,754 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,757 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:17,757 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:17,757 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times
[2025-02-08 14:25:17,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:17,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723278828]
[2025-02-08 14:25:17,758 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:17,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:17,763 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-08 14:25:17,765 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-08 14:25:17,765 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,765 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,765 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:17,766 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-08 14:25:17,767 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-08 14:25:17,767 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,767 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,769 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:17,770 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:17,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 44789614, now seen corresponding path program 1 times
[2025-02-08 14:25:17,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:17,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688084162]
[2025-02-08 14:25:17,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:17,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:17,774 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-02-08 14:25:17,780 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-02-08 14:25:17,780 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,780 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,780 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:17,782 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-02-08 14:25:17,785 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-02-08 14:25:17,785 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,785 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,787 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:18,167 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-08 14:25:18,167 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-08 14:25:18,167 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-08 14:25:18,167 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-08 14:25:18,168 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-08 14:25:18,168 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,168 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-08 14:25:18,170 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-08 14:25:18,170 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration6_Lasso
[2025-02-08 14:25:18,170 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-08 14:25:18,170 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-08 14:25:18,172 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,440 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,443 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,444 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,446 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,447 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,449 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,451 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,456 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,458 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,459 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,462 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,464 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,466 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:18,701 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-08 14:25:18,701 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-08 14:25:18,701 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,701 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,703 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,722 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,723 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-02-08 14:25:18,733 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:18,733 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:18,733 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:18,733 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:18,735 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:18,735 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:18,737 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:18,745 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0
[2025-02-08 14:25:18,746 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,746 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,748 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,749 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,750 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-02-08 14:25:18,760 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:18,760 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:18,760 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:18,760 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:18,762 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:18,762 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:18,764 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:18,769 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:18,770 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,770 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,772 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,772 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,774 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-02-08 14:25:18,784 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:18,784 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:18,784 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:18,784 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:18,787 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:18,787 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:18,791 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:18,797 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0
[2025-02-08 14:25:18,797 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,797 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,799 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,801 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,801 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-02-08 14:25:18,811 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:18,811 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:18,811 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:18,811 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:18,818 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:18,818 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:18,821 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:18,827 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:18,828 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,828 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,830 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,831 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,833 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-02-08 14:25:18,843 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:18,844 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:18,844 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:18,844 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:18,849 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:18,849 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:18,855 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:18,865 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:18,869 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,869 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,870 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,877 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,877 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-02-08 14:25:18,887 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:18,887 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:18,887 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:18,887 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:18,888 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:18,889 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:18,891 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:18,896 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0
[2025-02-08 14:25:18,897 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,897 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,898 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,903 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,905 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-02-08 14:25:18,915 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:18,915 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:18,915 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:18,915 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:18,917 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:18,917 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:18,921 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-08 14:25:18,930 INFO  L443   ModelExtractionUtils]: Simplification made 6 calls to the SMT solver.
[2025-02-08 14:25:18,930 INFO  L444   ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero.
[2025-02-08 14:25:18,930 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:18,930 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,932 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,934 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,935 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-08 14:25:18,949 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-08 14:25:18,949 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-08 14:25:18,949 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2 + 23
Supporting invariants []
[2025-02-08 14:25:18,960 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0
[2025-02-08 14:25:18,992 INFO  L156   tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed
[2025-02-08 14:25:18,993 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2025-02-08 14:25:18,993 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2025-02-08 14:25:18,993 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,<LOCAL,main>]]]
[2025-02-08 14:25:19,002 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:19,014 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-08 14:25:19,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-08 14:25:19,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:19,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:19,020 INFO  L256         TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:19,020 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:19,025 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-08 14:25:19,027 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-08 14:25:19,027 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:19,027 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:19,028 INFO  L256         TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:19,028 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:19,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:19,042 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-02-08 14:25:19,042 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 31 transitions. cyclomatic complexity: 5 Second operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-02-08 14:25:19,058 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 31 transitions. cyclomatic complexity: 5. Second operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 72 states and 78 transitions. Complement of second has 7 states.
[2025-02-08 14:25:19,059 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-02-08 14:25:19,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-02-08 14:25:19,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions.
[2025-02-08 14:25:19,060 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 2 letters.
[2025-02-08 14:25:19,060 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:19,060 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 5 letters. Loop has 2 letters.
[2025-02-08 14:25:19,061 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:19,061 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 4 letters.
[2025-02-08 14:25:19,061 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:19,061 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 78 transitions.
[2025-02-08 14:25:19,062 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-08 14:25:19,062 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 54 states and 58 transitions.
[2025-02-08 14:25:19,062 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 6
[2025-02-08 14:25:19,063 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 6
[2025-02-08 14:25:19,063 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions.
[2025-02-08 14:25:19,063 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-08 14:25:19,063 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 54 states and 58 transitions.
[2025-02-08 14:25:19,063 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions.
[2025-02-08 14:25:19,064 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49.
[2025-02-08 14:25:19,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 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-02-08 14:25:19,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions.
[2025-02-08 14:25:19,065 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 49 states and 52 transitions.
[2025-02-08 14:25:19,065 INFO  L432   stractBuchiCegarLoop]: Abstraction has 49 states and 52 transitions.
[2025-02-08 14:25:19,065 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-02-08 14:25:19,065 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 52 transitions.
[2025-02-08 14:25:19,066 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-08 14:25:19,066 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:19,066 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:19,066 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1]
[2025-02-08 14:25:19,066 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-02-08 14:25:19,066 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" 
[2025-02-08 14:25:19,067 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-02-08 14:25:19,067 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:19,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -1242615969, now seen corresponding path program 2 times
[2025-02-08 14:25:19,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:19,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804673167]
[2025-02-08 14:25:19,067 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:19,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:19,081 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes.
[2025-02-08 14:25:19,093 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements.
[2025-02-08 14:25:19,093 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-08 14:25:19,093 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:19,093 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:19,096 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-02-08 14:25:19,105 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-02-08 14:25:19,105 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:19,105 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:19,111 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:19,112 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:19,112 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times
[2025-02-08 14:25:19,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:19,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097179173]
[2025-02-08 14:25:19,112 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:19,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:19,118 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-02-08 14:25:19,119 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-08 14:25:19,119 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:19,120 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:19,120 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:19,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-08 14:25:19,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-08 14:25:19,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:19,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:19,122 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:19,123 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:19,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -153037634, now seen corresponding path program 3 times
[2025-02-08 14:25:19,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:19,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687142447]
[2025-02-08 14:25:19,123 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:25:19,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:19,132 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 11 equivalence classes.
[2025-02-08 14:25:19,158 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 28 of 28 statements.
[2025-02-08 14:25:19,158 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2025-02-08 14:25:19,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:19,158 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:19,161 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-02-08 14:25:19,169 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-02-08 14:25:19,170 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:19,170 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:19,173 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:45,465 WARN  L286               SmtUtils]: Spent 26.24s on a formula simplification. DAG size of input: 272 DAG size of output: 237 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2025-02-08 14:25:45,514 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0
[2025-02-08 14:25:45,656 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-08 14:25:45,656 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-08 14:25:45,656 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-08 14:25:45,656 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-08 14:25:45,656 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-08 14:25:45,656 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:45,656 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-08 14:25:45,656 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-08 14:25:45,656 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration7_Lasso
[2025-02-08 14:25:45,657 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-08 14:25:45,657 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-08 14:25:45,658 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,855 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,858 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,860 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,861 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,863 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,864 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,866 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,867 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,869 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,870 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,872 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,873 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:45,875 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:46,097 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-08 14:25:46,097 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-08 14:25:46,098 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,098 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,100 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,101 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,105 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-02-08 14:25:46,115 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,115 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,115 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,115 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,118 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,118 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,122 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,127 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,128 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,128 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,130 INFO  L229       MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,132 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,133 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-02-08 14:25:46,143 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,143 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,143 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,143 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,150 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,150 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,157 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,170 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0
[2025-02-08 14:25:46,170 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,170 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,173 INFO  L229       MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,177 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,178 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-02-08 14:25:46,188 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,189 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,189 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,189 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,190 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,190 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,192 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,199 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,199 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,199 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,203 INFO  L229       MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,204 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,208 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-02-08 14:25:46,218 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,218 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,218 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,218 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,222 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,222 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,226 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,233 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,235 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,235 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,237 INFO  L229       MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,238 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,240 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-02-08 14:25:46,251 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,251 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,251 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,251 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,254 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,254 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,259 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,265 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,266 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,266 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,268 INFO  L229       MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,269 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,270 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-02-08 14:25:46,280 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,280 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,280 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,280 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,282 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,282 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,289 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,295 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,298 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,298 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,300 INFO  L229       MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,302 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,303 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-02-08 14:25:46,313 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,313 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,313 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,313 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,316 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,316 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,320 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,326 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,326 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,326 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,328 INFO  L229       MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,329 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,330 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-02-08 14:25:46,339 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,339 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,339 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,339 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,343 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,343 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,345 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,350 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0
[2025-02-08 14:25:46,351 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,351 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,354 INFO  L229       MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,355 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,357 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-02-08 14:25:46,367 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,367 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,367 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,367 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,369 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,369 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,372 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,378 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,379 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,379 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,381 INFO  L229       MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,381 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,383 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-02-08 14:25:46,392 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,392 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,392 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,392 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,393 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,393 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,396 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:46,401 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0
[2025-02-08 14:25:46,402 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,402 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,404 INFO  L229       MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,405 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,406 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-02-08 14:25:46,416 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:46,416 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:46,416 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:46,416 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:46,419 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:46,419 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:46,423 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-08 14:25:46,441 INFO  L443   ModelExtractionUtils]: Simplification made 9 calls to the SMT solver.
[2025-02-08 14:25:46,441 INFO  L444   ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero.
[2025-02-08 14:25:46,441 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:46,441 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:46,443 INFO  L229       MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:25:46,444 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process
[2025-02-08 14:25:46,445 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-08 14:25:46,457 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-08 14:25:46,457 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-08 14:25:46,457 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~j~0#1.base) 0)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~j~0#1.base) 0)_1 + 23
Supporting invariants []
[2025-02-08 14:25:46,463 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,498 INFO  L156   tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed
[2025-02-08 14:25:46,500 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2025-02-08 14:25:46,500 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2025-02-08 14:25:46,500 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,<LOCAL,main>]]]
[2025-02-08 14:25:46,516 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:46,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-02-08 14:25:46,558 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-02-08 14:25:46,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:46,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:46,560 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:46,561 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:46,639 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-08 14:25:46,642 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-08 14:25:46,642 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:46,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:46,644 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:46,644 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:46,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:46,660 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates 
[2025-02-08 14:25:46,660 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 52 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.2) 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-02-08 14:25:46,704 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 52 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.2) 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 67 states and 72 transitions. Complement of second has 8 states.
[2025-02-08 14:25:46,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-02-08 14:25:46,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.2) 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-02-08 14:25:46,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions.
[2025-02-08 14:25:46,706 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 26 letters. Loop has 2 letters.
[2025-02-08 14:25:46,727 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:46,728 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-08 14:25:46,738 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:46,747 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:46,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-02-08 14:25:46,790 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-02-08 14:25:46,790 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:46,790 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:46,791 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:46,792 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:46,866 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-08 14:25:46,869 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-08 14:25:46,869 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:46,869 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:46,870 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:46,871 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:46,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:46,891 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates 
[2025-02-08 14:25:46,891 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 52 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.2) 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-02-08 14:25:46,930 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 52 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.2) 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 67 states and 72 transitions. Complement of second has 8 states.
[2025-02-08 14:25:46,931 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-02-08 14:25:46,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.2) 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-02-08 14:25:46,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions.
[2025-02-08 14:25:46,931 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 26 letters. Loop has 2 letters.
[2025-02-08 14:25:46,932 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:46,932 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-08 14:25:46,952 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:46,968 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-02-08 14:25:46,994 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-02-08 14:25:46,994 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:46,994 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:46,995 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:46,996 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:47,061 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-08 14:25:47,064 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-08 14:25:47,064 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:47,064 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:47,065 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:47,065 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:47,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:47,079 INFO  L141   lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates 
[2025-02-08 14:25:47,079 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 52 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.2) 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-02-08 14:25:47,132 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 52 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.2) 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 75 states and 81 transitions. Complement of second has 7 states.
[2025-02-08 14:25:47,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-02-08 14:25:47,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.2) 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-02-08 14:25:47,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions.
[2025-02-08 14:25:47,135 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 26 letters. Loop has 2 letters.
[2025-02-08 14:25:47,135 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:47,135 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 28 letters. Loop has 2 letters.
[2025-02-08 14:25:47,135 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:47,135 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 26 letters. Loop has 4 letters.
[2025-02-08 14:25:47,135 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:47,135 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions.
[2025-02-08 14:25:47,137 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-02-08 14:25:47,137 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 0 states and 0 transitions.
[2025-02-08 14:25:47,137 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2025-02-08 14:25:47,137 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2025-02-08 14:25:47,137 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2025-02-08 14:25:47,137 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:25:47,137 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-08 14:25:47,137 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-08 14:25:47,137 INFO  L432   stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-08 14:25:47,137 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2025-02-08 14:25:47,137 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2025-02-08 14:25:47,137 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-02-08 14:25:47,137 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2025-02-08 14:25:47,143 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:25:47 BoogieIcfgContainer
[2025-02-08 14:25:47,143 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-02-08 14:25:47,144 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-08 14:25:47,144 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-08 14:25:47,144 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-08 14:25:47,144 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:02" (3/4) ...
[2025-02-08 14:25:47,146 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-02-08 14:25:47,146 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-08 14:25:47,147 INFO  L158              Benchmark]: Toolchain (without parser) took 45332.97ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 108.5MB in the beginning and 193.1MB in the end (delta: -84.6MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB.
[2025-02-08 14:25:47,147 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:25:47,147 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 228.67ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 92.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-08 14:25:47,148 INFO  L158              Benchmark]: Boogie Procedure Inliner took 21.88ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:25:47,148 INFO  L158              Benchmark]: Boogie Preprocessor took 19.80ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.6MB in the end (delta: 953.2kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:25:47,148 INFO  L158              Benchmark]: IcfgBuilder took 204.14ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 76.7MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-08 14:25:47,148 INFO  L158              Benchmark]: BuchiAutomizer took 44851.86ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 76.7MB in the beginning and 193.2MB in the end (delta: -116.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB.
[2025-02-08 14:25:47,148 INFO  L158              Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 285.2MB. Free memory was 193.2MB in the beginning and 193.1MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:25:47,149 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.21ms. Allocated memory is still 226.5MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 228.67ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 92.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 21.88ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 19.80ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.6MB in the end (delta: 953.2kB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 204.14ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 76.7MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 44851.86ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 76.7MB in the beginning and 193.2MB in the end (delta: -116.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB.
 * Witness Printer took 2.93ms. Allocated memory is still 285.2MB. Free memory was 193.2MB in the beginning and 193.1MB in the end (delta: 83.0kB). 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: #memory_int#0
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#1
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#1
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,<LOCAL,main>]]]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 20 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 44.8s and 8 iterations.  TraceHistogramMax:10. Analysis of lassos took 43.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [2, 0, 1, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 90/90	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 49 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks:   Lassos: inital204 mio100 ax108 hnf100 lsp91 ukn76 mio100 lsp23 div100 bol100 ite100 ukn100 eq159 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 3 VariablesLoop: 3 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-02-08 14:25:47,161 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-08 14:25:47,361 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:47,580 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE