./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 c00e63dc
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-?-c00e63d-m
[2025-02-06 19:06:02,279 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 19:06:02,335 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2025-02-06 19:06:02,341 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 19:06:02,343 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 19:06:02,343 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG
[2025-02-06 19:06:02,364 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 19:06:02,364 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 19:06:02,364 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 19:06:02,365 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 19:06:02,365 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 19:06:02,365 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 19:06:02,365 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 19:06:02,366 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 19:06:02,367 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-02-06 19:06:02,367 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 19:06:02,367 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-02-06 19:06:02,368 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-02-06 19:06:02,368 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-02-06 19:06:02,368 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-06 19:06:02,368 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 19:06:02,368 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-02-06 19:06:02,368 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 19:06:02,368 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 19:06:02,368 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 19:06:02,369 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 19:06:02,369 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 19:06:02,369 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 19:06:02,369 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-02-06 19:06:02,369 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-06 19:06:02,592 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 19:06:02,600 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 19:06:02,601 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 19:06:02,602 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 19:06:02,604 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 19:06:02,605 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-06 19:06:03,722 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01ec1d8ae/59f07e97e0264605b136794a184f1e3b/FLAG66696cbfa
[2025-02-06 19:06:04,001 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 19:06:04,001 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i
[2025-02-06 19:06:04,008 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01ec1d8ae/59f07e97e0264605b136794a184f1e3b/FLAG66696cbfa
[2025-02-06 19:06:04,018 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01ec1d8ae/59f07e97e0264605b136794a184f1e3b
[2025-02-06 19:06:04,019 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 19:06:04,020 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 19:06:04,021 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 19:06:04,021 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 19:06:04,024 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 19:06:04,024 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,025 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5b80f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04, skipping insertion in model container
[2025-02-06 19:06:04,025 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,047 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 19:06:04,201 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 19:06:04,209 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 19:06:04,231 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 19:06:04,247 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 19:06:04,247 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04 WrapperNode
[2025-02-06 19:06:04,248 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 19:06:04,248 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 19:06:04,248 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 19:06:04,248 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 19:06:04,252 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,262 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,271 INFO  L138                Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56
[2025-02-06 19:06:04,272 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 19:06:04,272 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 19:06:04,272 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 19:06:04,272 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 19:06:04,277 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,277 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,278 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,285 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-06 19:06:04,285 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,285 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,288 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,288 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,289 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,289 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,290 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 19:06:04,291 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 19:06:04,291 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 19:06:04,291 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 19:06:04,292 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (1/1) ...
[2025-02-06 19:06:04,295 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:04,303 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:04,317 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-06 19:06:04,321 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-06 19:06:04,338 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-06 19:06:04,338 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-06 19:06:04,338 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-02-06 19:06:04,338 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-06 19:06:04,338 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-06 19:06:04,338 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-02-06 19:06:04,339 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-02-06 19:06:04,339 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-06 19:06:04,339 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 19:06:04,339 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 19:06:04,401 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 19:06:04,402 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 19:06:04,477 INFO  L1309  $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-06 19:06:04,481 INFO  L?                        ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2025-02-06 19:06:04,482 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 19:06:04,487 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 19:06:04,488 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 19:06:04,488 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:06:04 BoogieIcfgContainer
[2025-02-06 19:06:04,488 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 19:06:04,489 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-02-06 19:06:04,489 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-02-06 19:06:04,493 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-02-06 19:06:04,493 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:06:04,493 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:06:04" (1/3) ...
[2025-02-06 19:06:04,494 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b872fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:06:04, skipping insertion in model container
[2025-02-06 19:06:04,494 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:06:04,494 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:06:04" (2/3) ...
[2025-02-06 19:06:04,494 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b872fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:06:04, skipping insertion in model container
[2025-02-06 19:06:04,494 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:06:04,494 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:06:04" (3/3) ...
[2025-02-06 19:06:04,495 INFO  L363   chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i
[2025-02-06 19:06:04,524 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-02-06 19:06:04,524 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-02-06 19:06:04,525 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-02-06 19:06:04,525 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-02-06 19:06:04,525 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-02-06 19:06:04,525 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-02-06 19:06:04,525 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-02-06 19:06:04,525 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-02-06 19:06:04,528 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:04,541 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:06:04,541 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:06:04,542 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:06:04,544 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:06:04,544 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-02-06 19:06:04,544 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-02-06 19:06:04,545 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:04,545 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:06:04,545 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:06:04,545 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:06:04,545 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:06:04,546 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-02-06 19:06:04,549 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-06 19:06:04,549 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-06 19:06:04,552 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:04,553 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times
[2025-02-06 19:06:04,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:04,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005950954]
[2025-02-06 19:06:04,558 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:04,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:04,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:04,657 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:04,659 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:04,659 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:04,659 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:04,665 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:04,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:04,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:04,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:04,698 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:04,700 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:04,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384154, now seen corresponding path program 1 times
[2025-02-06 19:06:04,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:04,700 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005862480]
[2025-02-06 19:06:04,700 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:04,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:04,708 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-06 19:06:04,714 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-06 19:06:04,714 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:04,714 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:04,742 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-06 19:06:04,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:06:04,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005862480]
[2025-02-06 19:06:04,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005862480] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 19:06:04,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 19:06:04,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 19:06:04,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889921514]
[2025-02-06 19:06:04,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 19:06:04,746 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:06:04,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:06:04,766 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 19:06:04,766 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 19:06:04,767 INFO  L87              Difference]: Start difference. First operand  has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-06 19:06:04,771 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:06:04,772 INFO  L93              Difference]: Finished difference Result 11 states and 12 transitions.
[2025-02-06 19:06:04,772 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions.
[2025-02-06 19:06:04,773 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:06:04,776 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions.
[2025-02-06 19:06:04,776 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2025-02-06 19:06:04,777 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2025-02-06 19:06:04,777 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions.
[2025-02-06 19:06:04,777 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:06:04,777 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-02-06 19:06:04,785 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions.
[2025-02-06 19:06:04,791 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7.
[2025-02-06 19:06:04,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:04,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions.
[2025-02-06 19:06:04,792 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-02-06 19:06:04,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 19:06:04,795 INFO  L432   stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-02-06 19:06:04,796 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-02-06 19:06:04,796 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions.
[2025-02-06 19:06:04,797 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:06:04,797 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:06:04,797 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:06:04,797 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:06:04,797 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1]
[2025-02-06 19:06:04,797 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-06 19:06:04,797 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-06 19:06:04,798 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:04,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 2 times
[2025-02-06 19:06:04,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:04,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490727482]
[2025-02-06 19:06:04,799 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:06:04,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:04,814 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:04,827 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:04,829 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:06:04,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:04,829 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:04,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:04,837 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:04,837 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:04,837 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:04,839 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:04,840 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:04,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 42907910, now seen corresponding path program 1 times
[2025-02-06 19:06:04,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:04,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519914240]
[2025-02-06 19:06:04,840 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:04,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:04,844 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-02-06 19:06:04,851 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-02-06 19:06:04,851 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:04,851 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:04,933 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-06 19:06:04,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:06:04,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519914240]
[2025-02-06 19:06:04,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519914240] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 19:06:04,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 19:06:04,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 19:06:04,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249037214]
[2025-02-06 19:06:04,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 19:06:04,934 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:06:04,934 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:06:04,935 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 19:06:04,935 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-06 19:06:04,935 INFO  L87              Difference]: Start difference. First operand 7 states and 8 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-06 19:06:04,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:06:04,958 INFO  L93              Difference]: Finished difference Result 9 states and 10 transitions.
[2025-02-06 19:06:04,958 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions.
[2025-02-06 19:06:04,959 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-06 19:06:04,959 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions.
[2025-02-06 19:06:04,959 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 9
[2025-02-06 19:06:04,959 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 9
[2025-02-06 19:06:04,959 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions.
[2025-02-06 19:06:04,959 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:06:04,959 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-02-06 19:06:04,960 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions.
[2025-02-06 19:06:04,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2025-02-06 19:06:04,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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-06 19:06:04,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions.
[2025-02-06 19:06:04,960 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-02-06 19:06:04,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 19:06:04,961 INFO  L432   stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-02-06 19:06:04,961 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-02-06 19:06:04,961 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions.
[2025-02-06 19:06:04,961 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-06 19:06:04,962 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:06:04,962 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:06:04,962 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:06:04,962 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1]
[2025-02-06 19:06:04,962 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-06 19:06:04,962 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-06 19:06:04,963 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:04,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 3 times
[2025-02-06 19:06:04,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:04,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364457345]
[2025-02-06 19:06:04,963 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:06:04,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:04,970 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:04,976 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:04,976 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-06 19:06:04,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:04,976 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:04,978 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:04,983 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:04,983 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:04,983 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:04,985 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:04,985 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:04,986 INFO  L85        PathProgramCache]: Analyzing trace with hash -1715136633, now seen corresponding path program 1 times
[2025-02-06 19:06:04,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:04,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21993626]
[2025-02-06 19:06:04,986 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:04,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:04,992 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-06 19:06:04,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-06 19:06:04,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:04,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:05,130 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-06 19:06:05,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:06:05,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21993626]
[2025-02-06 19:06:05,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21993626] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:06:05,131 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258740106]
[2025-02-06 19:06:05,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:05,131 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:06:05,131 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:05,135 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-06 19:06:05,136 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-06 19:06:05,209 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-06 19:06:05,221 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-06 19:06:05,221 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:05,221 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:05,223 INFO  L256         TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:05,224 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:05,249 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-06 19:06:05,265 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-06 19:06:05,280 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-06 19:06:05,281 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:06:05,318 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-06 19:06:05,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258740106] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:06:05,319 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:06:05,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10
[2025-02-06 19:06:05,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410342983]
[2025-02-06 19:06:05,320 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:06:05,320 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:06:05,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:06:05,320 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-06 19:06:05,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-02-06 19:06:05,321 INFO  L87              Difference]: Start difference. First operand 9 states and 10 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-06 19:06:05,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:06:05,379 INFO  L93              Difference]: Finished difference Result 15 states and 16 transitions.
[2025-02-06 19:06:05,379 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions.
[2025-02-06 19:06:05,379 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2025-02-06 19:06:05,380 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions.
[2025-02-06 19:06:05,381 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2025-02-06 19:06:05,381 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 15
[2025-02-06 19:06:05,381 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions.
[2025-02-06 19:06:05,381 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:06:05,381 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-02-06 19:06:05,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions.
[2025-02-06 19:06:05,382 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2025-02-06 19:06:05,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:05,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions.
[2025-02-06 19:06:05,383 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-02-06 19:06:05,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-06 19:06:05,384 INFO  L432   stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-02-06 19:06:05,384 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-02-06 19:06:05,385 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions.
[2025-02-06 19:06:05,385 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2025-02-06 19:06:05,385 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:06:05,385 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:06:05,385 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:06:05,385 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1]
[2025-02-06 19:06:05,385 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-06 19:06:05,385 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-06 19:06:05,386 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:05,386 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 4 times
[2025-02-06 19:06:05,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:05,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940099394]
[2025-02-06 19:06:05,386 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 19:06:05,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:05,397 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes.
[2025-02-06 19:06:05,408 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:05,411 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-06 19:06:05,411 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:05,411 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:05,413 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:05,423 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:05,424 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:05,424 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:05,425 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:05,426 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:05,426 INFO  L85        PathProgramCache]: Analyzing trace with hash -2058696310, now seen corresponding path program 2 times
[2025-02-06 19:06:05,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:05,426 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192471879]
[2025-02-06 19:06:05,426 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:06:05,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:05,436 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes.
[2025-02-06 19:06:05,447 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-06 19:06:05,451 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:06:05,452 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:05,840 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-06 19:06:05,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:06:05,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192471879]
[2025-02-06 19:06:05,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192471879] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:06:05,841 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506321187]
[2025-02-06 19:06:05,841 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:06:05,841 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:06:05,841 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:05,843 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-06 19:06:05,845 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-06 19:06:05,882 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes.
[2025-02-06 19:06:05,899 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-06 19:06:05,899 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:06:05,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:05,899 INFO  L256         TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:05,901 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:05,903 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-06 19:06:05,910 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-06 19:06:05,923 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-06 19:06:05,936 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-06 19:06:05,949 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-06 19:06:05,961 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-06 19:06:05,962 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:06:06,029 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-06 19:06:06,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [506321187] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:06:06,030 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:06:06,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20
[2025-02-06 19:06:06,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336788126]
[2025-02-06 19:06:06,030 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:06:06,030 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:06:06,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:06:06,031 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-02-06 19:06:06,031 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380
[2025-02-06 19:06:06,031 INFO  L87              Difference]: Start difference. First operand 15 states and 16 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-06 19:06:06,161 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:06:06,162 INFO  L93              Difference]: Finished difference Result 25 states and 26 transitions.
[2025-02-06 19:06:06,162 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions.
[2025-02-06 19:06:06,162 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2025-02-06 19:06:06,162 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions.
[2025-02-06 19:06:06,163 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 25
[2025-02-06 19:06:06,163 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 25
[2025-02-06 19:06:06,163 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions.
[2025-02-06 19:06:06,163 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:06:06,163 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-02-06 19:06:06,163 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions.
[2025-02-06 19:06:06,164 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2025-02-06 19:06:06,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:06,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions.
[2025-02-06 19:06:06,164 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-02-06 19:06:06,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-06 19:06:06,165 INFO  L432   stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-02-06 19:06:06,165 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-02-06 19:06:06,165 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions.
[2025-02-06 19:06:06,166 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2025-02-06 19:06:06,166 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:06:06,166 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:06:06,166 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:06:06,166 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1]
[2025-02-06 19:06:06,166 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-06 19:06:06,166 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-06 19:06:06,166 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:06,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 5 times
[2025-02-06 19:06:06,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:06,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40495972]
[2025-02-06 19:06:06,167 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-06 19:06:06,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:06,172 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:06,180 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:06,180 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:06:06,180 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:06,180 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:06,181 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:06,188 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:06,188 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:06,188 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:06,190 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:06,190 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:06,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -1231859057, now seen corresponding path program 3 times
[2025-02-06 19:06:06,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:06,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807032106]
[2025-02-06 19:06:06,190 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:06:06,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:06,210 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 10 equivalence classes.
[2025-02-06 19:06:06,245 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-06 19:06:06,246 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s)
[2025-02-06 19:06:06,246 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:06,246 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:06,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-02-06 19:06:06,256 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-06 19:06:06,256 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:06,256 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:06,267 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:06,267 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:06,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -1008009808, now seen corresponding path program 1 times
[2025-02-06 19:06:06,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:06,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505633170]
[2025-02-06 19:06:06,267 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:06,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:06,286 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-02-06 19:06:06,315 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-02-06 19:06:06,315 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:06,315 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:06,315 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:06,318 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-02-06 19:06:06,340 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-02-06 19:06:06,340 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:06,340 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:06,345 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:16,311 WARN  L286               SmtUtils]: Spent 9.96s 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-06 19:06:16,620 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:06:16,620 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:06:16,621 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:06:16,621 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:06:16,621 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:06:16,621 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:16,621 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:06:16,621 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:06:16,621 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration5_Lasso
[2025-02-06 19:06:16,623 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:06:16,624 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:06:16,638 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,643 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,644 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,647 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,975 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,978 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,980 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,986 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,988 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,989 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,991 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,993 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:16,995 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:17,281 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:06:17,286 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:06:17,287 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,288 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,292 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-06 19:06:17,293 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-06 19:06:17,294 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-06 19:06:17,304 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,305 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:06:17,305 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,305 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,305 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,308 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:06:17,308 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:06:17,309 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,315 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2025-02-06 19:06:17,316 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,316 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,317 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-06 19:06:17,323 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-06 19:06:17,323 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:06:17,332 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,333 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:06:17,333 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,333 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,333 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,333 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:06:17,333 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:06:17,334 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,340 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:17,340 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,340 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,342 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-06 19:06:17,343 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-06 19:06:17,344 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:06:17,353 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,354 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,354 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,354 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,362 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:17,362 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:17,369 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,375 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:17,379 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,379 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,380 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-06 19:06:17,381 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-06 19:06:17,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-06 19:06:17,393 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,393 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,393 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,393 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,396 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:17,396 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:17,400 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,406 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:17,406 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,407 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,408 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-06 19:06:17,410 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-06 19:06:17,411 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:06:17,420 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,420 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,420 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,420 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,424 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:17,424 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:17,427 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,433 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:17,433 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,433 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,437 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-06 19:06:17,438 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-06 19:06:17,439 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-06 19:06:17,449 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,449 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,449 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,449 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,451 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:17,451 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:17,455 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,461 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-06 19:06:17,461 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,462 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,464 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-06 19:06:17,465 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-06 19:06:17,466 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:06:17,475 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,476 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,476 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,476 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,477 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:17,477 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:17,480 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,485 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-06 19:06:17,486 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,486 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,490 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-06 19:06:17,491 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-06 19:06:17,492 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-06 19:06:17,502 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,502 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,502 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,502 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,505 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:17,505 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:17,509 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,515 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:17,515 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,515 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,517 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-06 19:06:17,522 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-06 19:06:17,522 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-06 19:06:17,534 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,534 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,534 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,534 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,536 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:17,536 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:17,540 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:17,545 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:17,546 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,546 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,547 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-06 19:06:17,549 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-06 19:06:17,550 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-06 19:06:17,559 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:17,559 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:17,559 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:17,559 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:17,562 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:17,562 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:17,567 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:06:17,576 INFO  L443   ModelExtractionUtils]: Simplification made 6 calls to the SMT solver.
[2025-02-06 19:06:17,578 INFO  L444   ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero.
[2025-02-06 19:06:17,579 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:17,579 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:17,581 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-06 19:06:17,584 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:06:17,588 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-06 19:06:17,595 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:06:17,596 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:06:17,596 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-06 19:06:17,602 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-06 19:06:17,658 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-06 19:06:17,714 INFO  L156   tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed
[2025-02-06 19:06:17,722 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2025-02-06 19:06:17,723 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2025-02-06 19:06:17,723 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-06 19:06:17,751 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:17,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:17,773 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:17,774 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:17,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:17,774 INFO  L256         TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:17,778 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:17,800 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-02-06 19:06:17,841 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-06 19:06:17,842 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:17,842 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:17,843 INFO  L256         TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:17,846 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:17,981 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-06 19:06:17,983 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-06 19:06:17,984 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:18,037 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 51 transitions. Complement of second has 6 states.
[2025-02-06 19:06:18,039 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-06 19:06:18,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:18,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions.
[2025-02-06 19:06:18,043 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters.
[2025-02-06 19:06:18,045 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:18,045 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters.
[2025-02-06 19:06:18,045 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:18,045 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters.
[2025-02-06 19:06:18,045 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:18,046 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions.
[2025-02-06 19:06:18,046 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-06 19:06:18,048 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions.
[2025-02-06 19:06:18,048 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 23
[2025-02-06 19:06:18,048 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2025-02-06 19:06:18,048 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions.
[2025-02-06 19:06:18,048 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:06:18,049 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions.
[2025-02-06 19:06:18,049 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions.
[2025-02-06 19:06:18,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29.
[2025-02-06 19:06:18,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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-06 19:06:18,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions.
[2025-02-06 19:06:18,051 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions.
[2025-02-06 19:06:18,051 INFO  L432   stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions.
[2025-02-06 19:06:18,051 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-02-06 19:06:18,052 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions.
[2025-02-06 19:06:18,052 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-06 19:06:18,052 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:06:18,052 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:06:18,052 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2025-02-06 19:06:18,052 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-02-06 19:06:18,052 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-06 19:06:18,053 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-06 19:06:18,053 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:18,053 INFO  L85        PathProgramCache]: Analyzing trace with hash 1476575, now seen corresponding path program 1 times
[2025-02-06 19:06:18,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:18,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834812491]
[2025-02-06 19:06:18,054 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:18,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:18,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-06 19:06:18,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-06 19:06:18,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:18,070 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:18,070 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:18,071 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-06 19:06:18,078 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-06 19:06:18,078 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:18,078 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:18,079 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:18,082 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:18,082 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times
[2025-02-06 19:06:18,082 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:18,082 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488637160]
[2025-02-06 19:06:18,082 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:18,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:18,085 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:18,086 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:18,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:18,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:18,086 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:18,086 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:18,087 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:18,087 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:18,087 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:18,091 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:18,091 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:18,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 1418988862, now seen corresponding path program 1 times
[2025-02-06 19:06:18,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:18,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680739701]
[2025-02-06 19:06:18,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:06:18,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:18,096 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-02-06 19:06:18,100 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-02-06 19:06:18,100 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:18,100 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:18,101 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:18,103 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-02-06 19:06:18,106 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-02-06 19:06:18,109 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:18,109 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:18,110 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:18,461 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:06:18,461 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:06:18,461 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:06:18,461 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:06:18,461 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:06:18,461 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:18,461 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:06:18,461 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:06:18,461 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration6_Lasso
[2025-02-06 19:06:18,461 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:06:18,462 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:06:18,466 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,703 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,705 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,706 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,707 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,708 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,718 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,720 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,721 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,722 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,723 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,725 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,726 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,728 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:18,960 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:06:18,960 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:06:18,960 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:18,960 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:18,962 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-06 19:06:18,963 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-06 19:06:18,964 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-06 19:06:18,973 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:18,974 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:18,974 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:18,974 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:18,975 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:18,975 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:18,977 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:18,984 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0
[2025-02-06 19:06:18,985 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:18,988 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:18,991 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-06 19:06:18,993 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-06 19:06:18,994 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-06 19:06:19,003 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:19,004 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:19,004 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:19,004 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:19,004 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:19,008 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:19,011 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:19,021 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:19,022 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:19,022 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:19,026 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-06 19:06:19,027 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-06 19:06:19,029 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:06:19,039 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:19,039 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:19,039 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:19,039 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:19,045 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:19,045 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:19,048 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:19,055 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-06 19:06:19,056 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:19,056 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:19,059 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-06 19:06:19,064 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-06 19:06:19,064 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-06 19:06:19,081 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:19,081 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:19,081 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:19,081 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:19,087 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:19,087 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:19,090 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:19,099 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0
[2025-02-06 19:06:19,099 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:19,099 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:19,103 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-06 19:06:19,104 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-06 19:06:19,104 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-06 19:06:19,114 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:19,114 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:19,114 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:19,114 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:19,117 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:19,117 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:19,120 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:19,127 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-06 19:06:19,127 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:19,127 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:19,132 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-06 19:06:19,136 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-06 19:06:19,137 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:06:19,146 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:19,147 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:19,147 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:19,147 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:19,148 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:19,148 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:19,150 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:19,158 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-06 19:06:19,158 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:19,158 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:19,162 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-06 19:06:19,162 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-06 19:06:19,167 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-06 19:06:19,177 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:19,177 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:19,177 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:19,177 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:19,179 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:19,179 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:19,184 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:06:19,198 INFO  L443   ModelExtractionUtils]: Simplification made 8 calls to the SMT solver.
[2025-02-06 19:06:19,199 INFO  L444   ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero.
[2025-02-06 19:06:19,199 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:19,199 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:19,200 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-06 19:06:19,201 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-06 19:06:19,203 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:06:19,213 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:06:19,213 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:06:19,213 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-06 19:06:19,221 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-06 19:06:19,264 INFO  L156   tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed
[2025-02-06 19:06:19,266 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2025-02-06 19:06:19,266 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2025-02-06 19:06:19,266 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-06 19:06:19,293 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:19,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-06 19:06:19,347 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-06 19:06:19,347 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:19,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:19,348 INFO  L256         TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:19,348 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:19,367 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:19,373 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:19,374 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:19,374 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:19,377 INFO  L256         TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:19,377 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:19,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:06:19,409 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-06 19:06:19,409 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:19,444 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 79 transitions. Complement of second has 7 states.
[2025-02-06 19:06:19,445 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-06 19:06:19,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:19,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions.
[2025-02-06 19:06:19,445 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters.
[2025-02-06 19:06:19,445 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:19,445 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters.
[2025-02-06 19:06:19,445 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:19,445 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters.
[2025-02-06 19:06:19,446 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:19,446 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions.
[2025-02-06 19:06:19,446 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-06 19:06:19,447 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions.
[2025-02-06 19:06:19,447 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2025-02-06 19:06:19,447 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2025-02-06 19:06:19,447 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions.
[2025-02-06 19:06:19,447 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:06:19,447 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 55 states and 59 transitions.
[2025-02-06 19:06:19,447 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions.
[2025-02-06 19:06:19,448 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50.
[2025-02-06 19:06:19,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:19,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions.
[2025-02-06 19:06:19,455 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions.
[2025-02-06 19:06:19,455 INFO  L432   stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions.
[2025-02-06 19:06:19,455 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-02-06 19:06:19,455 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions.
[2025-02-06 19:06:19,455 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-06 19:06:19,455 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:06:19,455 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:06:19,456 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1]
[2025-02-06 19:06:19,456 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-02-06 19:06:19,456 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-06 19:06:19,456 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-06 19:06:19,456 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:19,456 INFO  L85        PathProgramCache]: Analyzing trace with hash 1965183887, now seen corresponding path program 2 times
[2025-02-06 19:06:19,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:19,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667893656]
[2025-02-06 19:06:19,456 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:06:19,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:19,494 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-06 19:06:19,510 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes.
[2025-02-06 19:06:19,533 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:06:19,533 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:06:19,534 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:19,534 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:19,541 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-06 19:06:19,559 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:06:19,559 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:19,559 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:19,569 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:19,569 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:19,569 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times
[2025-02-06 19:06:19,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:19,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373561841]
[2025-02-06 19:06:19,569 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:06:19,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:19,571 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:19,572 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:19,572 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:06:19,572 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:19,572 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:19,573 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:19,574 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:19,574 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:19,574 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:19,578 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:19,578 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:19,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -1243894546, now seen corresponding path program 3 times
[2025-02-06 19:06:19,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:06:19,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192849984]
[2025-02-06 19:06:19,579 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:06:19,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:06:19,603 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 11 equivalence classes.
[2025-02-06 19:06:19,664 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 29 of 29 statements.
[2025-02-06 19:06:19,664 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2025-02-06 19:06:19,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:19,664 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:06:19,671 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-02-06 19:06:19,694 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-02-06 19:06:19,694 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:19,694 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:06:19,701 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:06:41,732 WARN  L286               SmtUtils]: Spent 21.97s 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-06 19:06:41,860 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:06:41,860 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:06:41,860 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:06:41,860 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:06:41,860 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:06:41,860 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:41,861 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:06:41,861 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:06:41,861 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration7_Lasso
[2025-02-06 19:06:41,861 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:06:41,861 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:06:41,862 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,082 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,084 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,086 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,087 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,089 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,091 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,093 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,094 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,096 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,098 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,099 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,101 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,103 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:06:42,346 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:06:42,347 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:06:42,347 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,347 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,349 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-06 19:06:42,350 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-06 19:06:42,353 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-06 19:06:42,363 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,363 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,363 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,363 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,365 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,365 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,369 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,375 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:42,376 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,377 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,379 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-06 19:06:42,380 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-06 19:06:42,381 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-06 19:06:42,390 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,390 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,390 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,390 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,392 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,392 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,396 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,401 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-06 19:06:42,402 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,402 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,404 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-06 19:06:42,405 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-06 19:06:42,405 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-06 19:06:42,415 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,415 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,415 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,415 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,418 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,418 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,420 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,426 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-06 19:06:42,426 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,426 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,429 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-06 19:06:42,429 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-06 19:06:42,431 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-06 19:06:42,440 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,440 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,440 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,441 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,443 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,443 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,448 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,454 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-06 19:06:42,454 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,454 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,456 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-06 19:06:42,457 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-06 19:06:42,459 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-06 19:06:42,470 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,470 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,470 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,470 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,471 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,471 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,473 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,479 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0
[2025-02-06 19:06:42,480 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,480 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,482 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-06 19:06:42,483 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-06 19:06:42,484 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:06:42,495 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,496 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,496 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,496 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,498 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,498 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,504 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,509 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0
[2025-02-06 19:06:42,510 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,510 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,512 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-06 19:06:42,513 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-06 19:06:42,513 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-06 19:06:42,524 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,524 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,524 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,524 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,527 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,527 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,531 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,537 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:42,537 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,537 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,539 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-06 19:06:42,540 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-06 19:06:42,541 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-06 19:06:42,551 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,551 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,551 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,551 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,552 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,552 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,555 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,561 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0
[2025-02-06 19:06:42,561 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,561 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,563 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-06 19:06:42,565 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-06 19:06:42,565 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-06 19:06:42,577 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,578 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,578 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,578 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,580 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,580 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,583 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,591 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0
[2025-02-06 19:06:42,591 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,591 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,594 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-06 19:06:42,595 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-06 19:06:42,596 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:06:42,608 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,608 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,608 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,608 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,611 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,611 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,613 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:06:42,619 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-06 19:06:42,619 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,620 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,621 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-06 19:06:42,623 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-06 19:06:42,624 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-06 19:06:42,634 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:06:42,634 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:06:42,634 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:06:42,634 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:06:42,636 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:06:42,636 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:06:42,641 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:06:42,666 INFO  L443   ModelExtractionUtils]: Simplification made 10 calls to the SMT solver.
[2025-02-06 19:06:42,667 INFO  L444   ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero.
[2025-02-06 19:06:42,667 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:06:42,667 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:06:42,668 INFO  L229       MonitoredProcess]: Starting monitored process 34 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-06 19:06:42,670 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process
[2025-02-06 19:06:42,671 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:06:42,681 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:06:42,681 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:06:42,681 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-06 19:06:42,688 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-06 19:06:42,739 INFO  L156   tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed
[2025-02-06 19:06:42,741 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2025-02-06 19:06:42,744 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2025-02-06 19:06:42,744 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-06 19:06:42,771 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:42,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-06 19:06:42,842 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:06:42,843 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:42,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:42,844 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:42,849 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:42,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:42,968 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:42,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:42,969 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:42,969 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:42,970 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:42,996 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-06 19:06:42,996 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-06 19:06:42,996 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:43,064 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 73 transitions. Complement of second has 8 states.
[2025-02-06 19:06:43,065 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-06 19:06:43,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:43,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions.
[2025-02-06 19:06:43,066 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-02-06 19:06:43,066 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:43,066 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-06 19:06:43,089 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:43,116 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-06 19:06:43,160 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:06:43,161 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:43,161 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:43,162 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:43,168 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:43,270 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:43,272 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:43,272 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:43,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:43,274 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:43,277 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:43,298 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-06 19:06:43,299 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-06 19:06:43,299 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:43,348 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 73 transitions. Complement of second has 8 states.
[2025-02-06 19:06:43,348 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-06 19:06:43,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:43,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions.
[2025-02-06 19:06:43,349 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-02-06 19:06:43,349 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:43,349 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-06 19:06:43,362 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:06:43,387 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-06 19:06:43,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:06:43,417 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:43,417 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:43,418 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:43,420 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:43,498 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:06:43,505 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:06:43,506 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:06:43,506 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:06:43,506 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-02-06 19:06:43,506 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:06:43,535 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-06 19:06:43,536 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-06 19:06:43,536 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:43,604 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 82 transitions. Complement of second has 7 states.
[2025-02-06 19:06:43,605 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-06 19:06:43,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:06:43,605 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions.
[2025-02-06 19:06:43,605 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-02-06 19:06:43,605 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:43,605 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 29 letters. Loop has 2 letters.
[2025-02-06 19:06:43,606 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:43,606 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 27 letters. Loop has 4 letters.
[2025-02-06 19:06:43,606 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:06:43,606 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions.
[2025-02-06 19:06:43,607 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-02-06 19:06:43,607 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions.
[2025-02-06 19:06:43,607 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2025-02-06 19:06:43,607 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2025-02-06 19:06:43,607 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2025-02-06 19:06:43,607 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:06:43,607 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:06:43,607 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:06:43,607 INFO  L432   stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:06:43,607 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2025-02-06 19:06:43,607 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2025-02-06 19:06:43,607 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-02-06 19:06:43,607 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2025-02-06 19:06:43,612 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:06:43 BoogieIcfgContainer
[2025-02-06 19:06:43,612 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-02-06 19:06:43,613 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-06 19:06:43,613 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-06 19:06:43,613 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-06 19:06:43,613 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:06:04" (3/4) ...
[2025-02-06 19:06:43,614 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-02-06 19:06:43,615 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-06 19:06:43,615 INFO  L158              Benchmark]: Toolchain (without parser) took 39594.85ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 120.7MB in the beginning and 192.8MB in the end (delta: -72.1MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB.
[2025-02-06 19:06:43,615 INFO  L158              Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:06:43,615 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 226.80ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 104.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-06 19:06:43,615 INFO  L158              Benchmark]: Boogie Procedure Inliner took 23.35ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 103.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:06:43,615 INFO  L158              Benchmark]: Boogie Preprocessor took 18.25ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 102.2MB in the end (delta: 754.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:06:43,616 INFO  L158              Benchmark]: IcfgBuilder took 197.38ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 89.2MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-06 19:06:43,616 INFO  L158              Benchmark]: BuchiAutomizer took 39123.42ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 88.5MB in the beginning and 192.9MB in the end (delta: -104.4MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB.
[2025-02-06 19:06:43,616 INFO  L158              Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 360.7MB. Free memory was 192.9MB in the beginning and 192.8MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:06:43,617 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 226.80ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 104.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 23.35ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 103.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 18.25ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 102.2MB in the end (delta: 754.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 197.38ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 89.2MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 39123.42ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 88.5MB in the beginning and 192.9MB in the end (delta: -104.4MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB.
 * Witness Printer took 2.16ms. Allocated memory is still 360.7MB. Free memory was 192.9MB in the beginning and 192.8MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #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 39.0s and 8 iterations.  TraceHistogramMax:10. Analysis of lassos took 37.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. 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, 69 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 58 mSDtfsCounter, 168 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: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Termination proven
    Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2025-02-06 19:06:43,631 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0
[2025-02-06 19:06:43,832 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-06 19:06:44,036 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-06 19:06:44,242 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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