./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --architecture 32bit


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


Checking for termination
Using default analysis
Version 551b0097
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/loop-simple/nested_3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-10 07:35:42,381 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-10 07:35:42,431 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2025-01-10 07:35:42,434 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-10 07:35:42,436 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-10 07:35:42,453 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-10 07:35:42,454 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-10 07:35:42,454 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-10 07:35:42,454 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-10 07:35:42,454 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-10 07:35:42,454 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-10 07:35:42,455 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-10 07:35:42,455 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-10 07:35:42,455 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-01-10 07:35:42,455 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-01-10 07:35:42,455 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-01-10 07:35:42,455 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-01-10 07:35:42,455 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-01-10 07:35:42,455 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-01-10 07:35:42,457 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-01-10 07:35:42,457 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-10 07:35:42,458 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-10 07:35:42,458 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-10 07:35:42,458 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-10 07:35:42,458 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-10 07:35:42,458 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-10 07:35:42,458 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-01-10 07:35:42,458 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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9
[2025-01-10 07:35:42,669 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-10 07:35:42,676 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-10 07:35:42,679 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-10 07:35:42,680 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-10 07:35:42,680 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-10 07:35:42,681 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_3.c
[2025-01-10 07:35:43,843 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5e0509bb/6a802c5881314d18bee65b7b5fdbff46/FLAGab45a8440
[2025-01-10 07:35:44,084 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-10 07:35:44,085 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c
[2025-01-10 07:35:44,112 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5e0509bb/6a802c5881314d18bee65b7b5fdbff46/FLAGab45a8440
[2025-01-10 07:35:44,426 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5e0509bb/6a802c5881314d18bee65b7b5fdbff46
[2025-01-10 07:35:44,428 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-10 07:35:44,429 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-10 07:35:44,429 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-10 07:35:44,430 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-10 07:35:44,433 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-10 07:35:44,433 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,434 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344e6249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44, skipping insertion in model container
[2025-01-10 07:35:44,434 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,443 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-10 07:35:44,536 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-10 07:35:44,545 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-10 07:35:44,554 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-10 07:35:44,565 INFO  L204         MainTranslator]: Completed translation
[2025-01-10 07:35:44,566 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44 WrapperNode
[2025-01-10 07:35:44,567 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-10 07:35:44,568 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-10 07:35:44,568 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-10 07:35:44,568 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-10 07:35:44,572 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,577 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,590 INFO  L138                Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32
[2025-01-10 07:35:44,590 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-10 07:35:44,590 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-10 07:35:44,590 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-10 07:35:44,592 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-10 07:35:44,597 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,597 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,598 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,608 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-01-10 07:35:44,608 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,608 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,610 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,611 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,613 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,614 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,614 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,618 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-10 07:35:44,618 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-10 07:35:44,618 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-10 07:35:44,618 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-10 07:35:44,619 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (1/1) ...
[2025-01-10 07:35:44,623 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:44,633 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:44,646 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-01-10 07:35:44,650 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-01-10 07:35:44,668 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-10 07:35:44,669 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-10 07:35:44,669 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-10 07:35:44,669 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-10 07:35:44,707 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-10 07:35:44,708 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-10 07:35:44,771 INFO  L?                        ?]: Removed 5 outVars from TransFormulas that were not future-live.
[2025-01-10 07:35:44,772 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-10 07:35:44,776 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-10 07:35:44,777 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-01-10 07:35:44,777 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:44 BoogieIcfgContainer
[2025-01-10 07:35:44,777 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-10 07:35:44,778 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-01-10 07:35:44,778 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-01-10 07:35:44,781 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-01-10 07:35:44,781 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:35:44,781 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:35:44" (1/3) ...
[2025-01-10 07:35:44,782 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34d77d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:35:44, skipping insertion in model container
[2025-01-10 07:35:44,782 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:35:44,782 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:44" (2/3) ...
[2025-01-10 07:35:44,782 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34d77d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:35:44, skipping insertion in model container
[2025-01-10 07:35:44,782 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:35:44,782 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:44" (3/3) ...
[2025-01-10 07:35:44,783 INFO  L363   chiAutomizerObserver]: Analyzing ICFG nested_3.c
[2025-01-10 07:35:44,817 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-01-10 07:35:44,817 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-01-10 07:35:44,817 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-01-10 07:35:44,817 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-01-10 07:35:44,817 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-01-10 07:35:44,818 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-01-10 07:35:44,818 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-01-10 07:35:44,818 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-01-10 07:35:44,822 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-01-10 07:35:44,834 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 3
[2025-01-10 07:35:44,835 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:44,835 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:44,838 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-01-10 07:35:44,838 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-01-10 07:35:44,838 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-01-10 07:35:44,838 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-01-10 07:35:44,839 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 3
[2025-01-10 07:35:44,840 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:44,840 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:44,840 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-01-10 07:35:44,840 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-01-10 07:35:44,846 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" 
[2025-01-10 07:35:44,847 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume !(main_~b~0#1 < 6);main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" 
[2025-01-10 07:35:44,851 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:44,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2025-01-10 07:35:44,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:44,857 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040500561]
[2025-01-10 07:35:44,857 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:44,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:44,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:44,904 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:44,905 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:44,905 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:44,905 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:44,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:44,910 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:44,910 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:44,910 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:44,919 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:44,922 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:44,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 1165, now seen corresponding path program 1 times
[2025-01-10 07:35:44,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:44,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51373114]
[2025-01-10 07:35:44,923 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:44,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:44,926 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:44,929 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:44,929 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:44,930 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:44,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:44,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:35:44,979 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51373114]
[2025-01-10 07:35:44,980 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51373114] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:35:44,980 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:35:44,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-01-10 07:35:44,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944864256]
[2025-01-10 07:35:44,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:35:44,984 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:35:44,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:35:45,003 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-10 07:35:45,004 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-10 07:35:45,006 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-01-10 07:35:45,023 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:35:45,024 INFO  L93              Difference]: Finished difference Result 12 states and 15 transitions.
[2025-01-10 07:35:45,025 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions.
[2025-01-10 07:35:45,025 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-01-10 07:35:45,028 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 10 transitions.
[2025-01-10 07:35:45,029 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2025-01-10 07:35:45,029 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2025-01-10 07:35:45,030 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions.
[2025-01-10 07:35:45,030 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:35:45,030 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions.
[2025-01-10 07:35:45,039 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions.
[2025-01-10 07:35:45,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6.
[2025-01-10 07:35:45,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:45,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions.
[2025-01-10 07:35:45,049 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions.
[2025-01-10 07:35:45,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-10 07:35:45,052 INFO  L432   stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions.
[2025-01-10 07:35:45,054 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-01-10 07:35:45,054 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions.
[2025-01-10 07:35:45,054 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 4
[2025-01-10 07:35:45,055 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:45,055 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:45,055 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-01-10 07:35:45,055 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-01-10 07:35:45,056 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" 
[2025-01-10 07:35:45,056 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" 
[2025-01-10 07:35:45,056 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,056 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times
[2025-01-10 07:35:45,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543152091]
[2025-01-10 07:35:45,056 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:35:45,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,063 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,065 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,066 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-10 07:35:45,066 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,066 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:45,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,072 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,073 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,074 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,075 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:45,076 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,077 INFO  L85        PathProgramCache]: Analyzing trace with hash 1112391, now seen corresponding path program 1 times
[2025-01-10 07:35:45,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639700619]
[2025-01-10 07:35:45,077 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:45,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,082 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-01-10 07:35:45,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-01-10 07:35:45,085 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,085 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:45,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:45,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:35:45,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639700619]
[2025-01-10 07:35:45,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639700619] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:35:45,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:35:45,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-01-10 07:35:45,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482700603]
[2025-01-10 07:35:45,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:35:45,103 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:35:45,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:35:45,103 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-10 07:35:45,103 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-10 07:35:45,104 INFO  L87              Difference]: Start difference. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand  has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-01-10 07:35:45,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:35:45,114 INFO  L93              Difference]: Finished difference Result 7 states and 9 transitions.
[2025-01-10 07:35:45,114 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 9 transitions.
[2025-01-10 07:35:45,114 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-01-10 07:35:45,118 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 9 transitions.
[2025-01-10 07:35:45,118 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2025-01-10 07:35:45,118 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2025-01-10 07:35:45,118 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions.
[2025-01-10 07:35:45,118 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:35:45,118 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions.
[2025-01-10 07:35:45,118 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions.
[2025-01-10 07:35:45,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7.
[2025-01-10 07:35:45,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:45,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions.
[2025-01-10 07:35:45,119 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions.
[2025-01-10 07:35:45,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-10 07:35:45,120 INFO  L432   stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions.
[2025-01-10 07:35:45,120 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-01-10 07:35:45,120 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions.
[2025-01-10 07:35:45,121 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-01-10 07:35:45,121 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:45,121 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:45,121 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-01-10 07:35:45,121 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1]
[2025-01-10 07:35:45,121 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" 
[2025-01-10 07:35:45,121 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" 
[2025-01-10 07:35:45,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times
[2025-01-10 07:35:45,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408629309]
[2025-01-10 07:35:45,122 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-10 07:35:45,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,130 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,134 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,137 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-01-10 07:35:45,137 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,137 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:45,138 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,140 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,142 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,142 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,144 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:45,145 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 34482155, now seen corresponding path program 1 times
[2025-01-10 07:35:45,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460195848]
[2025-01-10 07:35:45,146 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:45,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,150 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-01-10 07:35:45,154 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-01-10 07:35:45,156 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,156 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:45,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:45,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:35:45,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460195848]
[2025-01-10 07:35:45,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460195848] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-10 07:35:45,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496240649]
[2025-01-10 07:35:45,191 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:45,191 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-10 07:35:45,192 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:45,195 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-01-10 07:35:45,196 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-01-10 07:35:45,223 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-01-10 07:35:45,227 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-01-10 07:35:45,227 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,227 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:45,230 INFO  L256         TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:45,231 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:45,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:45,256 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-10 07:35:45,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:45,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [496240649] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-10 07:35:45,283 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-10 07:35:45,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2025-01-10 07:35:45,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589704050]
[2025-01-10 07:35:45,283 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-10 07:35:45,284 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:35:45,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:35:45,284 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-10 07:35:45,284 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-01-10 07:35:45,284 INFO  L87              Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand  has 6 states, 6 states have (on average 1.3333333333333333) 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-01-10 07:35:45,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:35:45,300 INFO  L93              Difference]: Finished difference Result 10 states and 12 transitions.
[2025-01-10 07:35:45,301 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions.
[2025-01-10 07:35:45,301 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 8
[2025-01-10 07:35:45,302 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions.
[2025-01-10 07:35:45,302 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 10
[2025-01-10 07:35:45,302 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 10
[2025-01-10 07:35:45,302 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions.
[2025-01-10 07:35:45,302 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:35:45,302 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions.
[2025-01-10 07:35:45,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions.
[2025-01-10 07:35:45,303 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10.
[2025-01-10 07:35:45,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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-01-10 07:35:45,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions.
[2025-01-10 07:35:45,304 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions.
[2025-01-10 07:35:45,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-10 07:35:45,305 INFO  L432   stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions.
[2025-01-10 07:35:45,305 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-01-10 07:35:45,305 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions.
[2025-01-10 07:35:45,306 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 8
[2025-01-10 07:35:45,306 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:45,306 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:45,306 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-01-10 07:35:45,306 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1, 1, 1]
[2025-01-10 07:35:45,306 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" 
[2025-01-10 07:35:45,306 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" 
[2025-01-10 07:35:45,306 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,307 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times
[2025-01-10 07:35:45,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507443681]
[2025-01-10 07:35:45,307 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-01-10 07:35:45,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,310 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes.
[2025-01-10 07:35:45,311 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,311 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-01-10 07:35:45,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,312 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:45,312 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,314 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,314 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,315 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:45,315 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,315 INFO  L85        PathProgramCache]: Analyzing trace with hash 758743623, now seen corresponding path program 2 times
[2025-01-10 07:35:45,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487315276]
[2025-01-10 07:35:45,315 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:35:45,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,318 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes.
[2025-01-10 07:35:45,321 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:45,321 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-10 07:35:45,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:45,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-01-10 07:35:45,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:35:45,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487315276]
[2025-01-10 07:35:45,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487315276] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-10 07:35:45,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285988143]
[2025-01-10 07:35:45,363 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:35:45,363 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-10 07:35:45,363 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:45,367 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-01-10 07:35:45,368 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-01-10 07:35:45,392 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes.
[2025-01-10 07:35:45,396 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:45,397 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-10 07:35:45,397 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:45,397 INFO  L256         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:45,398 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:45,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:45,462 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-10 07:35:45,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:45,518 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285988143] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-10 07:35:45,518 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-10 07:35:45,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 7, 7] total 10
[2025-01-10 07:35:45,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642772410]
[2025-01-10 07:35:45,519 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-10 07:35:45,519 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:35:45,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:35:45,519 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-01-10 07:35:45,519 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-01-10 07:35:45,520 INFO  L87              Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand  has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-01-10 07:35:45,668 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:35:45,668 INFO  L93              Difference]: Finished difference Result 27 states and 31 transitions.
[2025-01-10 07:35:45,668 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions.
[2025-01-10 07:35:45,669 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 25
[2025-01-10 07:35:45,669 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions.
[2025-01-10 07:35:45,670 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 27
[2025-01-10 07:35:45,670 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 27
[2025-01-10 07:35:45,670 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions.
[2025-01-10 07:35:45,670 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:35:45,670 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions.
[2025-01-10 07:35:45,670 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions.
[2025-01-10 07:35:45,671 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20.
[2025-01-10 07:35:45,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:45,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions.
[2025-01-10 07:35:45,671 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions.
[2025-01-10 07:35:45,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-01-10 07:35:45,672 INFO  L432   stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions.
[2025-01-10 07:35:45,672 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-01-10 07:35:45,672 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions.
[2025-01-10 07:35:45,673 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 18
[2025-01-10 07:35:45,673 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:45,673 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:45,673 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-01-10 07:35:45,673 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [12, 2, 2, 1, 1]
[2025-01-10 07:35:45,673 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" 
[2025-01-10 07:35:45,673 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" 
[2025-01-10 07:35:45,674 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,674 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times
[2025-01-10 07:35:45,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419457319]
[2025-01-10 07:35:45,674 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-01-10 07:35:45,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,678 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,680 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,680 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-10 07:35:45,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,680 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:45,683 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,685 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,689 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:45,689 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,690 INFO  L85        PathProgramCache]: Analyzing trace with hash -2146349311, now seen corresponding path program 3 times
[2025-01-10 07:35:45,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830532653]
[2025-01-10 07:35:45,690 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-10 07:35:45,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,694 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 9 equivalence classes.
[2025-01-10 07:35:45,703 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 18 of 18 statements.
[2025-01-10 07:35:45,703 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s)
[2025-01-10 07:35:45,703 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:45,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2025-01-10 07:35:45,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:35:45,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830532653]
[2025-01-10 07:35:45,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830532653] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-10 07:35:45,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53701226]
[2025-01-10 07:35:45,764 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-10 07:35:45,765 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-10 07:35:45,765 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:45,767 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-10 07:35:45,771 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-01-10 07:35:45,798 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 9 equivalence classes.
[2025-01-10 07:35:45,810 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 18 of 18 statements.
[2025-01-10 07:35:45,811 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s)
[2025-01-10 07:35:45,811 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:45,811 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:45,812 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:45,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2025-01-10 07:35:45,847 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-10 07:35:45,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2025-01-10 07:35:45,888 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [53701226] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-10 07:35:45,889 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-10 07:35:45,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6
[2025-01-10 07:35:45,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125444331]
[2025-01-10 07:35:45,889 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-10 07:35:45,889 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:35:45,889 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:35:45,890 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-01-10 07:35:45,890 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2025-01-10 07:35:45,890 INFO  L87              Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 4 Second operand  has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-01-10 07:35:45,921 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:35:45,921 INFO  L93              Difference]: Finished difference Result 52 states and 59 transitions.
[2025-01-10 07:35:45,921 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 59 transitions.
[2025-01-10 07:35:45,922 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 50
[2025-01-10 07:35:45,922 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 59 transitions.
[2025-01-10 07:35:45,923 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 52
[2025-01-10 07:35:45,923 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 52
[2025-01-10 07:35:45,923 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 52 states and 59 transitions.
[2025-01-10 07:35:45,923 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:35:45,923 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 52 states and 59 transitions.
[2025-01-10 07:35:45,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states and 59 transitions.
[2025-01-10 07:35:45,924 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2025-01-10 07:35:45,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 52 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 51 states have internal predecessors, (59), 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-01-10 07:35:45,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions.
[2025-01-10 07:35:45,927 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 52 states and 59 transitions.
[2025-01-10 07:35:45,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-01-10 07:35:45,944 INFO  L432   stractBuchiCegarLoop]: Abstraction has 52 states and 59 transitions.
[2025-01-10 07:35:45,944 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-01-10 07:35:45,944 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 59 transitions.
[2025-01-10 07:35:45,945 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 50
[2025-01-10 07:35:45,945 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:45,945 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:45,945 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-01-10 07:35:45,945 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [36, 6, 6, 1, 1]
[2025-01-10 07:35:45,945 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" 
[2025-01-10 07:35:45,946 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" 
[2025-01-10 07:35:45,946 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times
[2025-01-10 07:35:45,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528640596]
[2025-01-10 07:35:45,948 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-01-10 07:35:45,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,951 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,953 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,954 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2025-01-10 07:35:45,954 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,954 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:45,955 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:45,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:45,956 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,956 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,957 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:45,958 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:45,958 INFO  L85        PathProgramCache]: Analyzing trace with hash -1015960599, now seen corresponding path program 4 times
[2025-01-10 07:35:45,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:45,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230830471]
[2025-01-10 07:35:45,958 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-01-10 07:35:45,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:45,963 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes.
[2025-01-10 07:35:45,983 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements.
[2025-01-10 07:35:45,983 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-01-10 07:35:45,983 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:45,983 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:45,986 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes.
[2025-01-10 07:35:45,999 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements.
[2025-01-10 07:35:45,999 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:45,999 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:46,003 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:46,003 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:46,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -1808303317, now seen corresponding path program 1 times
[2025-01-10 07:35:46,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:46,004 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629195221]
[2025-01-10 07:35:46,004 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:46,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:46,013 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-01-10 07:35:46,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-01-10 07:35:46,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:46,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:46,043 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:46,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-01-10 07:35:46,072 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-01-10 07:35:46,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:46,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:46,078 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:46,771 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:46,772 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:46,772 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:46,772 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:46,772 INFO  L128   ssoRankerPreferences]: Use exernal solver: true
[2025-01-10 07:35:46,772 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:46,773 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:46,773 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:46,773 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop
[2025-01-10 07:35:46,773 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:46,773 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:46,782 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,787 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,790 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,794 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,798 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,801 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,848 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:46,848 INFO  L365          LassoAnalysis]: Checking for nontermination...
[2025-01-10 07:35:46,850 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:46,850 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:46,852 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-01-10 07:35:46,854 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-01-10 07:35:46,856 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:46,856 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:46,871 INFO  L398          LassoAnalysis]: Proved nontermination for one component.
[2025-01-10 07:35:46,871 INFO  L401          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2025-01-10 07:35:46,878 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-01-10 07:35:46,878 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:46,879 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:46,880 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-01-10 07:35:46,881 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-01-10 07:35:46,883 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:46,884 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:46,897 INFO  L398          LassoAnalysis]: Proved nontermination for one component.
[2025-01-10 07:35:46,898 INFO  L401          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2025-01-10 07:35:46,904 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-01-10 07:35:46,905 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:46,905 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:46,907 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-01-10 07:35:46,908 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-01-10 07:35:46,913 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:46,913 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:46,931 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-01-10 07:35:46,931 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:46,931 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:46,933 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-01-10 07:35:46,934 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-01-10 07:35:46,935 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2025-01-10 07:35:46,935 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:46,957 INFO  L405          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2025-01-10 07:35:46,961 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2025-01-10 07:35:46,962 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:46,962 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:46,962 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:46,962 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:46,962 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-01-10 07:35:46,962 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:46,962 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:46,962 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:46,962 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop
[2025-01-10 07:35:46,962 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:46,962 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:46,963 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,965 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,966 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,970 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,978 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:46,984 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,014 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:47,016 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-01-10 07:35:47,017 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,018 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,020 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-01-10 07:35:47,022 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-01-10 07:35:47,023 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-01-10 07:35:47,035 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:47,035 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:47,036 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:47,036 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:47,036 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:47,040 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:47,040 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:47,042 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:35:47,047 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-01-10 07:35:47,047 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,047 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,049 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-01-10 07:35:47,050 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-01-10 07:35:47,051 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-01-10 07:35:47,061 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:47,061 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:47,061 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:47,061 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:47,061 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:47,062 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:47,062 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:47,063 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:35:47,069 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-01-10 07:35:47,069 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,070 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,071 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-01-10 07:35:47,073 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-01-10 07:35:47,074 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-01-10 07:35:47,084 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:47,084 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:47,084 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:47,084 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:47,084 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:47,089 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:47,089 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:47,090 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:35:47,096 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-01-10 07:35:47,097 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,097 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,099 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-01-10 07:35:47,100 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-01-10 07:35:47,102 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-01-10 07:35:47,111 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:47,111 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:47,111 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:47,111 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:47,111 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:47,112 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:47,112 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:47,114 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-01-10 07:35:47,116 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2025-01-10 07:35:47,118 INFO  L444   ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2025-01-10 07:35:47,119 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,119 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,122 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-01-10 07:35:47,124 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-01-10 07:35:47,125 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-01-10 07:35:47,125 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2025-01-10 07:35:47,125 INFO  L474          LassoAnalysis]: Proved termination.
[2025-01-10 07:35:47,126 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11
Supporting invariants []
[2025-01-10 07:35:47,131 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0
[2025-01-10 07:35:47,133 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2025-01-10 07:35:47,148 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,152 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-01-10 07:35:47,154 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-01-10 07:35:47,155 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,155 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:47,155 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:47,155 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:47,164 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes.
[2025-01-10 07:35:47,179 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements.
[2025-01-10 07:35:47,179 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,179 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:47,180 INFO  L256         TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:47,181 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:47,305 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0
[2025-01-10 07:35:47,396 INFO  L134       CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked.
[2025-01-10 07:35:47,399 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-01-10 07:35:47,400 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 59 transitions. cyclomatic complexity: 8 Second operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:47,427 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 59 transitions. cyclomatic complexity: 8. Second operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 102 states and 117 transitions. Complement of second has 4 states.
[2025-01-10 07:35:47,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2025-01-10 07:35:47,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:47,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions.
[2025-01-10 07:35:47,435 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 50 letters.
[2025-01-10 07:35:47,436 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,436 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 52 letters. Loop has 50 letters.
[2025-01-10 07:35:47,436 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,436 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 100 letters.
[2025-01-10 07:35:47,437 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,437 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 117 transitions.
[2025-01-10 07:35:47,438 INFO  L131   ngComponentsAnalysis]: Automaton has 6 accepting balls. 13
[2025-01-10 07:35:47,439 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 117 transitions.
[2025-01-10 07:35:47,439 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 51
[2025-01-10 07:35:47,439 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 52
[2025-01-10 07:35:47,440 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 102 states and 117 transitions.
[2025-01-10 07:35:47,440 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-01-10 07:35:47,440 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 102 states and 117 transitions.
[2025-01-10 07:35:47,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states and 117 transitions.
[2025-01-10 07:35:47,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 61.
[2025-01-10 07:35:47,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 60 states have internal predecessors, (71), 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-01-10 07:35:47,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions.
[2025-01-10 07:35:47,442 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 61 states and 71 transitions.
[2025-01-10 07:35:47,442 INFO  L432   stractBuchiCegarLoop]: Abstraction has 61 states and 71 transitions.
[2025-01-10 07:35:47,442 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-01-10 07:35:47,443 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 71 transitions.
[2025-01-10 07:35:47,443 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 8
[2025-01-10 07:35:47,443 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:47,443 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:47,443 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:35:47,444 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [6, 1, 1]
[2025-01-10 07:35:47,444 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" 
[2025-01-10 07:35:47,444 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" 
[2025-01-10 07:35:47,444 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,444 INFO  L85        PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times
[2025-01-10 07:35:47,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:47,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420826279]
[2025-01-10 07:35:47,444 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:47,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:47,447 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:35:47,450 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:35:47,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,454 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:47,455 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:35:47,456 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:35:47,456 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,457 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:47,459 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -1604902265, now seen corresponding path program 1 times
[2025-01-10 07:35:47,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:47,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854424849]
[2025-01-10 07:35:47,460 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:47,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:47,462 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-01-10 07:35:47,465 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:47,465 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,465 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,465 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:47,466 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-01-10 07:35:47,472 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:47,473 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,473 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,474 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:47,477 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,477 INFO  L85        PathProgramCache]: Analyzing trace with hash 1978783017, now seen corresponding path program 1 times
[2025-01-10 07:35:47,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:47,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239537809]
[2025-01-10 07:35:47,478 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:47,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:47,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-01-10 07:35:47,485 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-01-10 07:35:47,485 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,485 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,485 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:47,486 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-01-10 07:35:47,492 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-01-10 07:35:47,492 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,492 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,494 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:47,540 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:47,540 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:47,540 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:47,540 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:47,540 INFO  L128   ssoRankerPreferences]: Use exernal solver: true
[2025-01-10 07:35:47,540 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,540 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:47,541 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:47,541 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop
[2025-01-10 07:35:47,541 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:47,541 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:47,541 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,546 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,547 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,549 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,570 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:47,570 INFO  L365          LassoAnalysis]: Checking for nontermination...
[2025-01-10 07:35:47,570 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,571 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,574 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-01-10 07:35:47,575 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-01-10 07:35:47,576 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:47,576 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:47,593 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0
[2025-01-10 07:35:47,593 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,594 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,596 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-01-10 07:35:47,597 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-01-10 07:35:47,597 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2025-01-10 07:35:47,597 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:47,619 INFO  L405          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2025-01-10 07:35:47,624 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0
[2025-01-10 07:35:47,626 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:47,627 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:47,627 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:47,627 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:47,627 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-01-10 07:35:47,627 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,627 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:47,627 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:47,627 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop
[2025-01-10 07:35:47,627 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:47,627 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:47,627 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,632 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,634 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,636 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,657 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:47,657 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-01-10 07:35:47,657 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,657 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,659 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-01-10 07:35:47,661 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-01-10 07:35:47,662 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-01-10 07:35:47,672 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:47,672 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:47,672 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:47,672 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:47,672 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:47,673 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:47,673 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:47,675 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-01-10 07:35:47,676 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2025-01-10 07:35:47,676 INFO  L444   ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2025-01-10 07:35:47,677 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,677 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,679 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-01-10 07:35:47,681 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-01-10 07:35:47,681 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-01-10 07:35:47,682 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2025-01-10 07:35:47,682 INFO  L474          LassoAnalysis]: Proved termination.
[2025-01-10 07:35:47,682 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11
Supporting invariants []
[2025-01-10 07:35:47,688 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-01-10 07:35:47,689 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2025-01-10 07:35:47,700 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,702 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:35:47,705 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:35:47,705 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,705 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:47,706 INFO  L256         TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:47,706 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:47,711 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-01-10 07:35:47,714 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:47,714 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,714 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:47,714 INFO  L256         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:47,715 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:47,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-01-10 07:35:47,742 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-01-10 07:35:47,742 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 12 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-01-10 07:35:47,761 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 12. 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 170 states and 198 transitions. Complement of second has 7 states.
[2025-01-10 07:35:47,761 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-01-10 07:35:47,762 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-01-10 07:35:47,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions.
[2025-01-10 07:35:47,762 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 8 letters.
[2025-01-10 07:35:47,762 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,762 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 11 letters. Loop has 8 letters.
[2025-01-10 07:35:47,762 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,762 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 16 letters.
[2025-01-10 07:35:47,762 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,762 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 198 transitions.
[2025-01-10 07:35:47,764 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 9
[2025-01-10 07:35:47,765 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 127 states and 148 transitions.
[2025-01-10 07:35:47,765 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2025-01-10 07:35:47,765 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 19
[2025-01-10 07:35:47,765 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 127 states and 148 transitions.
[2025-01-10 07:35:47,766 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-01-10 07:35:47,766 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 127 states and 148 transitions.
[2025-01-10 07:35:47,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states and 148 transitions.
[2025-01-10 07:35:47,768 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 71.
[2025-01-10 07:35:47,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 70 states have internal predecessors, (84), 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-01-10 07:35:47,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions.
[2025-01-10 07:35:47,768 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 71 states and 84 transitions.
[2025-01-10 07:35:47,768 INFO  L432   stractBuchiCegarLoop]: Abstraction has 71 states and 84 transitions.
[2025-01-10 07:35:47,768 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2025-01-10 07:35:47,768 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 84 transitions.
[2025-01-10 07:35:47,769 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 9
[2025-01-10 07:35:47,769 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:47,769 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:47,769 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2025-01-10 07:35:47,769 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1]
[2025-01-10 07:35:47,769 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" 
[2025-01-10 07:35:47,769 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" 
[2025-01-10 07:35:47,769 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,769 INFO  L85        PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times
[2025-01-10 07:35:47,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:47,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29551164]
[2025-01-10 07:35:47,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:47,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:47,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-01-10 07:35:47,772 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-01-10 07:35:47,772 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,772 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,772 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:47,773 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-01-10 07:35:47,774 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-01-10 07:35:47,774 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,775 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:47,775 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times
[2025-01-10 07:35:47,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:47,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387215191]
[2025-01-10 07:35:47,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:47,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:47,776 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-01-10 07:35:47,777 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-01-10 07:35:47,777 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,777 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,777 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:47,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-01-10 07:35:47,777 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-01-10 07:35:47,777 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,777 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,778 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:47,778 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 28694823, now seen corresponding path program 1 times
[2025-01-10 07:35:47,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:47,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269673291]
[2025-01-10 07:35:47,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:35:47,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:47,779 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-01-10 07:35:47,784 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-01-10 07:35:47,784 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,784 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,784 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:47,785 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-01-10 07:35:47,786 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-01-10 07:35:47,786 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,786 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:47,787 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:47,798 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:47,798 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:47,798 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:47,798 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:47,798 INFO  L128   ssoRankerPreferences]: Use exernal solver: true
[2025-01-10 07:35:47,798 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,798 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:47,798 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:47,798 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop
[2025-01-10 07:35:47,798 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:47,798 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:47,799 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,800 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,815 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:47,815 INFO  L365          LassoAnalysis]: Checking for nontermination...
[2025-01-10 07:35:47,815 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,815 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,817 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-01-10 07:35:47,818 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-01-10 07:35:47,820 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:47,820 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:47,830 INFO  L398          LassoAnalysis]: Proved nontermination for one component.
[2025-01-10 07:35:47,831 INFO  L401          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2025-01-10 07:35:47,836 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-01-10 07:35:47,837 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,837 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,839 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-01-10 07:35:47,839 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-01-10 07:35:47,842 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:47,842 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:47,859 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0
[2025-01-10 07:35:47,859 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,859 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,861 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-01-10 07:35:47,862 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-01-10 07:35:47,864 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2025-01-10 07:35:47,864 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:47,886 INFO  L405          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2025-01-10 07:35:47,890 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0
[2025-01-10 07:35:47,890 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:47,891 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:47,891 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:47,891 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:47,891 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-01-10 07:35:47,891 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,891 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:47,891 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:47,891 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop
[2025-01-10 07:35:47,891 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:47,891 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:47,892 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,893 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:47,909 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:47,909 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-01-10 07:35:47,909 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,909 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,911 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-01-10 07:35:47,912 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-01-10 07:35:47,914 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-01-10 07:35:47,923 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:47,924 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:47,924 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:47,924 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:47,924 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:47,924 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:47,925 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:47,926 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:35:47,932 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0
[2025-01-10 07:35:47,932 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,932 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,934 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-01-10 07:35:47,936 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-01-10 07:35:47,937 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-01-10 07:35:47,947 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:47,947 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:47,948 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:47,948 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:47,948 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:47,948 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:47,948 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:47,950 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-01-10 07:35:47,952 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2025-01-10 07:35:47,952 INFO  L444   ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2025-01-10 07:35:47,952 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:47,952 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:47,955 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-01-10 07:35:47,956 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-01-10 07:35:47,957 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-01-10 07:35:47,957 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2025-01-10 07:35:47,957 INFO  L474          LassoAnalysis]: Proved termination.
[2025-01-10 07:35:47,957 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11
Supporting invariants []
[2025-01-10 07:35:47,964 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-01-10 07:35:47,965 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2025-01-10 07:35:47,974 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:47,976 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-01-10 07:35:47,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-01-10 07:35:47,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:47,980 INFO  L256         TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:47,980 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:47,984 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-01-10 07:35:47,985 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-01-10 07:35:47,985 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:47,985 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:47,986 WARN  L254         TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:47,986 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:47,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:47,986 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 
[2025-01-10 07:35:47,987 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 84 transitions. cyclomatic complexity: 17 Second operand  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-01-10 07:35:47,994 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 84 transitions. cyclomatic complexity: 17. Second operand  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 92 states and 108 transitions. Complement of second has 5 states.
[2025-01-10 07:35:47,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2025-01-10 07:35:47,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-01-10 07:35:47,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions.
[2025-01-10 07:35:47,995 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 1 letters.
[2025-01-10 07:35:47,995 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,995 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 1 letters.
[2025-01-10 07:35:47,995 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,995 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters.
[2025-01-10 07:35:47,995 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:47,995 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 108 transitions.
[2025-01-10 07:35:47,996 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 9
[2025-01-10 07:35:47,997 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 88 states and 103 transitions.
[2025-01-10 07:35:47,997 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 13
[2025-01-10 07:35:47,997 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 13
[2025-01-10 07:35:47,997 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 88 states and 103 transitions.
[2025-01-10 07:35:47,997 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-01-10 07:35:47,997 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 88 states and 103 transitions.
[2025-01-10 07:35:47,997 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states and 103 transitions.
[2025-01-10 07:35:47,999 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71.
[2025-01-10 07:35:47,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 70 states have internal predecessors, (83), 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-01-10 07:35:47,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions.
[2025-01-10 07:35:48,000 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 71 states and 83 transitions.
[2025-01-10 07:35:48,000 INFO  L432   stractBuchiCegarLoop]: Abstraction has 71 states and 83 transitions.
[2025-01-10 07:35:48,000 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 9 ============
[2025-01-10 07:35:48,000 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 83 transitions.
[2025-01-10 07:35:48,000 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 9
[2025-01-10 07:35:48,000 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:48,000 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:48,001 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [6, 2, 1, 1, 1, 1]
[2025-01-10 07:35:48,001 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1]
[2025-01-10 07:35:48,001 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" 
[2025-01-10 07:35:48,001 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" 
[2025-01-10 07:35:48,001 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 1212731393, now seen corresponding path program 2 times
[2025-01-10 07:35:48,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:48,001 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645921642]
[2025-01-10 07:35:48,002 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:35:48,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:48,004 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes.
[2025-01-10 07:35:48,007 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements.
[2025-01-10 07:35:48,007 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-10 07:35:48,007 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,007 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:48,008 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-01-10 07:35:48,010 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-01-10 07:35:48,010 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,010 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,011 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:48,011 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 2 times
[2025-01-10 07:35:48,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:48,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439842925]
[2025-01-10 07:35:48,012 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:35:48,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:48,013 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-01-10 07:35:48,013 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-01-10 07:35:48,013 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-10 07:35:48,013 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,013 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:48,014 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-01-10 07:35:48,014 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-01-10 07:35:48,014 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,014 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,014 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:48,015 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,015 INFO  L85        PathProgramCache]: Analyzing trace with hash -1060032467, now seen corresponding path program 3 times
[2025-01-10 07:35:48,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:48,015 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238895683]
[2025-01-10 07:35:48,015 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-10 07:35:48,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:48,017 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 5 equivalence classes.
[2025-01-10 07:35:48,023 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 13 of 13 statements.
[2025-01-10 07:35:48,023 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-01-10 07:35:48,023 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,023 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:48,024 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-01-10 07:35:48,026 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-01-10 07:35:48,026 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,026 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,027 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:48,036 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:48,037 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:48,037 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:48,037 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:48,037 INFO  L128   ssoRankerPreferences]: Use exernal solver: true
[2025-01-10 07:35:48,037 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,037 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:48,037 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:48,037 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop
[2025-01-10 07:35:48,037 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:48,037 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:48,037 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,039 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,053 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:48,053 INFO  L365          LassoAnalysis]: Checking for nontermination...
[2025-01-10 07:35:48,053 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,053 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,055 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-01-10 07:35:48,057 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-01-10 07:35:48,060 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:48,060 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:48,071 INFO  L398          LassoAnalysis]: Proved nontermination for one component.
[2025-01-10 07:35:48,072 INFO  L401          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2025-01-10 07:35:48,078 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-01-10 07:35:48,078 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,078 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,080 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-01-10 07:35:48,081 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-01-10 07:35:48,083 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:48,083 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:48,101 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-01-10 07:35:48,101 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,101 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,103 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-01-10 07:35:48,105 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-01-10 07:35:48,107 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2025-01-10 07:35:48,107 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:48,130 INFO  L405          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2025-01-10 07:35:48,135 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-01-10 07:35:48,135 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:48,135 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:48,135 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:48,136 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:48,136 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-01-10 07:35:48,136 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,136 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:48,136 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:48,136 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop
[2025-01-10 07:35:48,136 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:48,136 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:48,137 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,142 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,157 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:48,158 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-01-10 07:35:48,158 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,158 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,161 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-01-10 07:35:48,162 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-01-10 07:35:48,164 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-01-10 07:35:48,175 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:48,175 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:48,175 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:48,175 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:48,175 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:48,176 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:48,176 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:48,180 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:35:48,186 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0
[2025-01-10 07:35:48,186 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,186 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,188 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-01-10 07:35:48,190 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-01-10 07:35:48,191 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-01-10 07:35:48,201 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:48,201 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:48,201 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:48,201 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:48,201 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:48,204 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:48,204 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:48,208 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-01-10 07:35:48,210 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2025-01-10 07:35:48,210 INFO  L444   ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2025-01-10 07:35:48,210 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,210 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,212 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-01-10 07:35:48,214 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-01-10 07:35:48,214 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-01-10 07:35:48,215 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2025-01-10 07:35:48,215 INFO  L474          LassoAnalysis]: Proved termination.
[2025-01-10 07:35:48,215 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11
Supporting invariants []
[2025-01-10 07:35:48,221 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-01-10 07:35:48,222 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2025-01-10 07:35:48,239 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,244 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-01-10 07:35:48,249 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-01-10 07:35:48,249 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,249 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,250 INFO  L256         TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,250 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,263 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-01-10 07:35:48,264 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-01-10 07:35:48,264 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,264 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,264 WARN  L254         TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,265 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:48,265 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 
[2025-01-10 07:35:48,265 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 16 Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 07:35:48,273 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 16. Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 90 states and 105 transitions. Complement of second has 5 states.
[2025-01-10 07:35:48,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2025-01-10 07:35:48,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 07:35:48,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions.
[2025-01-10 07:35:48,278 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 12 letters. Loop has 1 letters.
[2025-01-10 07:35:48,278 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:48,278 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-01-10 07:35:48,287 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,292 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-01-10 07:35:48,297 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-01-10 07:35:48,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,298 INFO  L256         TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,299 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,313 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-01-10 07:35:48,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-01-10 07:35:48,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,314 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,314 WARN  L254         TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,314 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:48,315 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates 
[2025-01-10 07:35:48,316 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 16 Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 07:35:48,323 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 16. Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 90 states and 105 transitions. Complement of second has 5 states.
[2025-01-10 07:35:48,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2025-01-10 07:35:48,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 07:35:48,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions.
[2025-01-10 07:35:48,326 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 12 letters. Loop has 1 letters.
[2025-01-10 07:35:48,326 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:48,326 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-01-10 07:35:48,334 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,338 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-01-10 07:35:48,344 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-01-10 07:35:48,344 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,344 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,345 INFO  L256         TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,345 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,356 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-01-10 07:35:48,357 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-01-10 07:35:48,357 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,357 WARN  L254         TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,358 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-10 07:35:48,358 INFO  L141   lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 
[2025-01-10 07:35:48,358 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 16 Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 07:35:48,369 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 16. Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 85 states and 97 transitions. Complement of second has 4 states.
[2025-01-10 07:35:48,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2025-01-10 07:35:48,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 07:35:48,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions.
[2025-01-10 07:35:48,370 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 1 letters.
[2025-01-10 07:35:48,370 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:48,370 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 13 letters. Loop has 1 letters.
[2025-01-10 07:35:48,370 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:48,370 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters.
[2025-01-10 07:35:48,370 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:48,370 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 97 transitions.
[2025-01-10 07:35:48,371 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 8
[2025-01-10 07:35:48,371 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 63 states and 72 transitions.
[2025-01-10 07:35:48,371 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 5
[2025-01-10 07:35:48,371 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 6
[2025-01-10 07:35:48,372 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 63 states and 72 transitions.
[2025-01-10 07:35:48,372 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-01-10 07:35:48,372 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 63 states and 72 transitions.
[2025-01-10 07:35:48,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states and 72 transitions.
[2025-01-10 07:35:48,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61.
[2025-01-10 07:35:48,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 60 states have internal predecessors, (70), 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-01-10 07:35:48,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions.
[2025-01-10 07:35:48,378 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 61 states and 70 transitions.
[2025-01-10 07:35:48,378 INFO  L432   stractBuchiCegarLoop]: Abstraction has 61 states and 70 transitions.
[2025-01-10 07:35:48,378 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 10 ============
[2025-01-10 07:35:48,378 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 70 transitions.
[2025-01-10 07:35:48,378 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 8
[2025-01-10 07:35:48,378 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:35:48,378 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:35:48,379 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [36, 6, 6, 2, 1, 1, 1]
[2025-01-10 07:35:48,379 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [6, 1, 1]
[2025-01-10 07:35:48,379 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" 
[2025-01-10 07:35:48,379 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume main_~c~0#1 < 6;main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" 
[2025-01-10 07:35:48,381 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -222827973, now seen corresponding path program 2 times
[2025-01-10 07:35:48,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:48,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75741424]
[2025-01-10 07:35:48,382 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:35:48,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:48,388 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes.
[2025-01-10 07:35:48,399 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements.
[2025-01-10 07:35:48,399 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-10 07:35:48,399 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,399 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:48,402 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes.
[2025-01-10 07:35:48,423 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements.
[2025-01-10 07:35:48,423 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,423 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,427 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:48,427 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,427 INFO  L85        PathProgramCache]: Analyzing trace with hash -1604902265, now seen corresponding path program 2 times
[2025-01-10 07:35:48,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:48,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695153615]
[2025-01-10 07:35:48,427 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:35:48,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:48,429 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes.
[2025-01-10 07:35:48,434 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:48,434 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-10 07:35:48,434 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,434 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:48,435 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-01-10 07:35:48,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:48,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,436 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:48,441 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2025-01-10 07:35:48,444 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,444 INFO  L85        PathProgramCache]: Analyzing trace with hash 285618881, now seen corresponding path program 3 times
[2025-01-10 07:35:48,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:35:48,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534770840]
[2025-01-10 07:35:48,448 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-10 07:35:48,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:35:48,451 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-01-10 07:35:48,453 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 26 equivalence classes.
[2025-01-10 07:35:48,463 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-01-10 07:35:48,475 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) and asserted 61 of 61 statements.
[2025-01-10 07:35:48,475 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s)
[2025-01-10 07:35:48,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,475 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:35:48,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes.
[2025-01-10 07:35:48,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements.
[2025-01-10 07:35:48,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:35:48,494 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:35:48,541 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:48,541 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:48,541 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:48,541 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:48,541 INFO  L128   ssoRankerPreferences]: Use exernal solver: true
[2025-01-10 07:35:48,541 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,541 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:48,541 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:48,541 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop
[2025-01-10 07:35:48,541 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:48,541 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:48,542 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,547 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,548 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,551 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,574 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:48,574 INFO  L365          LassoAnalysis]: Checking for nontermination...
[2025-01-10 07:35:48,575 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,575 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,580 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-01-10 07:35:48,582 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-01-10 07:35:48,583 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:35:48,583 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:48,600 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0
[2025-01-10 07:35:48,601 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,601 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,602 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-01-10 07:35:48,603 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-01-10 07:35:48,604 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2025-01-10 07:35:48,604 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:35:48,626 INFO  L405          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2025-01-10 07:35:48,630 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0
[2025-01-10 07:35:48,630 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:35:48,630 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:35:48,630 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:35:48,630 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:35:48,630 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-01-10 07:35:48,630 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,630 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:35:48,630 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:35:48,630 INFO  L132   ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop
[2025-01-10 07:35:48,630 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:35:48,630 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:35:48,631 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,637 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,639 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,640 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:35:48,659 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:35:48,660 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-01-10 07:35:48,660 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,660 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,662 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-01-10 07:35:48,663 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-01-10 07:35:48,664 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-01-10 07:35:48,674 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:35:48,674 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:35:48,674 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:35:48,674 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:35:48,674 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:35:48,675 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:35:48,675 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:35:48,676 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-01-10 07:35:48,678 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2025-01-10 07:35:48,678 INFO  L444   ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2025-01-10 07:35:48,678 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:35:48,678 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:35:48,680 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-01-10 07:35:48,682 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-01-10 07:35:48,683 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-01-10 07:35:48,683 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2025-01-10 07:35:48,683 INFO  L474          LassoAnalysis]: Proved termination.
[2025-01-10 07:35:48,683 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11
Supporting invariants []
[2025-01-10 07:35:48,689 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0
[2025-01-10 07:35:48,690 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2025-01-10 07:35:48,697 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,705 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes.
[2025-01-10 07:35:48,719 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements.
[2025-01-10 07:35:48,719 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,719 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,720 INFO  L256         TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,721 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,769 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-01-10 07:35:48,772 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:48,772 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,772 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,772 INFO  L256         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,772 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-01-10 07:35:48,805 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-01-10 07:35:48,806 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 70 transitions. cyclomatic complexity: 11 Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:48,823 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 70 transitions. cyclomatic complexity: 11. Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 154 states and 178 transitions. Complement of second has 7 states.
[2025-01-10 07:35:48,824 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-01-10 07:35:48,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:48,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions.
[2025-01-10 07:35:48,825 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 53 letters. Loop has 8 letters.
[2025-01-10 07:35:48,825 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:48,825 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-01-10 07:35:48,835 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:48,847 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes.
[2025-01-10 07:35:48,872 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements.
[2025-01-10 07:35:48,872 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,872 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,873 INFO  L256         TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,874 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,928 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-01-10 07:35:48,931 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:48,931 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:48,931 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:48,932 INFO  L256         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:48,932 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:48,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-01-10 07:35:48,973 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates 
[2025-01-10 07:35:48,973 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 70 transitions. cyclomatic complexity: 11 Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:48,983 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 70 transitions. cyclomatic complexity: 11. Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 154 states and 178 transitions. Complement of second has 7 states.
[2025-01-10 07:35:48,984 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-01-10 07:35:48,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:48,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions.
[2025-01-10 07:35:48,984 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 53 letters. Loop has 8 letters.
[2025-01-10 07:35:48,985 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:48,985 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-01-10 07:35:48,994 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:35:49,008 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes.
[2025-01-10 07:35:49,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements.
[2025-01-10 07:35:49,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:49,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:49,021 INFO  L256         TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:49,022 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:49,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-01-10 07:35:49,071 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-01-10 07:35:49,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:35:49,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:35:49,072 INFO  L256         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:35:49,073 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:35:49,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-01-10 07:35:49,103 INFO  L141   lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2025-01-10 07:35:49,103 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 70 transitions. cyclomatic complexity: 11 Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:49,119 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 70 transitions. cyclomatic complexity: 11. Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 112 states and 130 transitions. Complement of second has 6 states.
[2025-01-10 07:35:49,119 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-01-10 07:35:49,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:35:49,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions.
[2025-01-10 07:35:49,120 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 53 letters. Loop has 8 letters.
[2025-01-10 07:35:49,120 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:49,120 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 61 letters. Loop has 8 letters.
[2025-01-10 07:35:49,120 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:49,120 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 53 letters. Loop has 16 letters.
[2025-01-10 07:35:49,121 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:35:49,121 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 130 transitions.
[2025-01-10 07:35:49,121 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-01-10 07:35:49,122 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 0 states and 0 transitions.
[2025-01-10 07:35:49,122 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2025-01-10 07:35:49,122 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2025-01-10 07:35:49,122 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2025-01-10 07:35:49,122 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:35:49,122 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-10 07:35:49,122 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-10 07:35:49,122 INFO  L432   stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-10 07:35:49,122 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 11 ============
[2025-01-10 07:35:49,122 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2025-01-10 07:35:49,122 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-01-10 07:35:49,122 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2025-01-10 07:35:49,128 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:35:49 BoogieIcfgContainer
[2025-01-10 07:35:49,129 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-01-10 07:35:49,129 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-01-10 07:35:49,129 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-01-10 07:35:49,129 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-01-10 07:35:49,130 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:44" (3/4) ...
[2025-01-10 07:35:49,131 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-01-10 07:35:49,132 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-01-10 07:35:49,133 INFO  L158              Benchmark]: Toolchain (without parser) took 4703.92ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 56.8MB in the end (delta: 67.1MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB.
[2025-01-10 07:35:49,133 INFO  L158              Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:35:49,133 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 138.32ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 113.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-10 07:35:49,133 INFO  L158              Benchmark]: Boogie Procedure Inliner took 21.75ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 112.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:35:49,133 INFO  L158              Benchmark]: Boogie Preprocessor took 27.44ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:35:49,133 INFO  L158              Benchmark]: RCFGBuilder took 158.72ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 101.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-10 07:35:49,133 INFO  L158              Benchmark]: BuchiAutomizer took 4351.05ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 56.8MB in the end (delta: 44.7MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB.
[2025-01-10 07:35:49,133 INFO  L158              Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory was 56.8MB in the beginning and 56.8MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:35:49,134 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 117.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 138.32ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 113.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 21.75ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 112.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 27.44ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 158.72ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 101.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 4351.05ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 56.8MB in the end (delta: 44.7MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB.
 * Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory was 56.8MB in the beginning and 56.8MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 4.3s and 11 iterations.  TraceHistogramMax:36. Analysis of lassos took 2.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [3, 0, 2, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 924/924	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 85 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks:   Lassos: inital12 mio100 ax100 hnf100 lsp83 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 5	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.3s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Termination proven
    Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2025-01-10 07:35:49,142 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0
[2025-01-10 07:35:49,347 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-01-10 07:35:49,547 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-01-10 07:35:49,748 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-01-10 07:35:49,948 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