./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.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/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.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 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-10 07:54:55,551 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-10 07:54:55,591 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:54:55,594 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-10 07:54:55,594 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-10 07:54:55,612 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-10 07:54:55,612 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-10 07:54:55,612 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-10 07:54:55,612 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-10 07:54:55,612 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-10 07:54:55,613 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-10 07:54:55,613 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-10 07:54:55,613 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-10 07:54:55,613 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-01-10 07:54:55,613 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-01-10 07:54:55,613 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-01-10 07:54:55,613 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-01-10 07:54:55,613 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-01-10 07:54:55,613 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-01-10 07:54:55,613 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-01-10 07:54:55,614 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-10 07:54:55,615 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-01-10 07:54:55,615 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-10 07:54:55,615 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-10 07:54:55,615 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-10 07:54:55,615 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-10 07:54:55,615 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-10 07:54:55,615 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-10 07:54:55,615 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-01-10 07:54:55,615 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 -> 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1
[2025-01-10 07:54:55,791 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-10 07:54:55,796 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-10 07:54:55,797 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-10 07:54:55,797 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-10 07:54:55,798 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-10 07:54:55,798 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c
[2025-01-10 07:54:56,867 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/099c08c00/490ba7a147af42909e91c28b66c6a850/FLAG89349b40d
[2025-01-10 07:54:57,182 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-10 07:54:57,183 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c
[2025-01-10 07:54:57,194 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/099c08c00/490ba7a147af42909e91c28b66c6a850/FLAG89349b40d
[2025-01-10 07:54:57,458 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/099c08c00/490ba7a147af42909e91c28b66c6a850
[2025-01-10 07:54:57,460 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-10 07:54:57,461 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-10 07:54:57,463 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-10 07:54:57,463 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-10 07:54:57,466 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-10 07:54:57,466 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,467 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a274b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57, skipping insertion in model container
[2025-01-10 07:54:57,467 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,488 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-10 07:54:57,644 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-10 07:54:57,672 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-10 07:54:57,732 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-10 07:54:57,758 INFO  L204         MainTranslator]: Completed translation
[2025-01-10 07:54:57,759 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57 WrapperNode
[2025-01-10 07:54:57,763 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-10 07:54:57,764 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-10 07:54:57,764 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-10 07:54:57,764 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-10 07:54:57,773 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:54:57" (1/1) ...
[2025-01-10 07:54:57,792 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:54:57" (1/1) ...
[2025-01-10 07:54:57,836 INFO  L138                Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 430
[2025-01-10 07:54:57,837 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-10 07:54:57,839 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-10 07:54:57,839 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-10 07:54:57,839 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-10 07:54:57,852 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,857 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,864 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,884 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:54:57,888 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,888 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,899 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,900 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,904 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,906 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,907 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,909 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-10 07:54:57,910 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-10 07:54:57,910 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-10 07:54:57,910 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-10 07:54:57,911 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (1/1) ...
[2025-01-10 07:54:57,916 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:54:57,926 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:54:57,944 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:54:57,948 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:54:57,967 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-10 07:54:57,967 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-10 07:54:57,968 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-10 07:54:57,968 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-10 07:54:58,042 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-10 07:54:58,044 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-10 07:54:58,388 INFO  L?                        ?]: Removed 43 outVars from TransFormulas that were not future-live.
[2025-01-10 07:54:58,388 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-10 07:54:58,396 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-10 07:54:58,396 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-01-10 07:54:58,396 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:54:58 BoogieIcfgContainer
[2025-01-10 07:54:58,396 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-10 07:54:58,397 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-01-10 07:54:58,397 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-01-10 07:54:58,401 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-01-10 07:54:58,401 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:54:58,401 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:54:57" (1/3) ...
[2025-01-10 07:54:58,402 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c045ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:54:58, skipping insertion in model container
[2025-01-10 07:54:58,402 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:54:58,402 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:54:57" (2/3) ...
[2025-01-10 07:54:58,402 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c045ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:54:58, skipping insertion in model container
[2025-01-10 07:54:58,402 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:54:58,402 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:54:58" (3/3) ...
[2025-01-10 07:54:58,403 INFO  L363   chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c
[2025-01-10 07:54:58,440 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-01-10 07:54:58,440 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-01-10 07:54:58,440 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-01-10 07:54:58,440 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-01-10 07:54:58,440 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-01-10 07:54:58,440 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-01-10 07:54:58,440 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-01-10 07:54:58,441 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-01-10 07:54:58,445 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 118 states, 117 states have (on average 1.7692307692307692) internal successors, (207), 117 states have internal predecessors, (207), 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:54:58,457 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 58
[2025-01-10 07:54:58,458 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:54:58,458 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:54:58,462 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:58,463 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:58,463 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-01-10 07:54:58,463 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 118 states, 117 states have (on average 1.7692307692307692) internal successors, (207), 117 states have internal predecessors, (207), 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:54:58,467 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 58
[2025-01-10 07:54:58,467 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:54:58,467 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:54:58,468 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:58,468 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:58,472 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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0;" "init_#res#1 := init_~tmp___5~0#1;" "main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" 
[2025-01-10 07:54:58,473 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" 
[2025-01-10 07:54:58,476 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:58,477 INFO  L85        PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times
[2025-01-10 07:54:58,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:58,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363937698]
[2025-01-10 07:54:58,482 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:54:58,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:58,541 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-01-10 07:54:58,612 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-01-10 07:54:58,612 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:58,612 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:54:58,848 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:54:58,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:54:58,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363937698]
[2025-01-10 07:54:58,852 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363937698] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:54:58,852 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:54:58,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-10 07:54:58,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499635819]
[2025-01-10 07:54:58,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:54:58,859 INFO  L757   eck$LassoCheckResult]: stem already infeasible
[2025-01-10 07:54:58,861 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:58,861 INFO  L85        PathProgramCache]: Analyzing trace with hash 1977480655, now seen corresponding path program 1 times
[2025-01-10 07:54:58,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:58,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309584210]
[2025-01-10 07:54:58,862 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:54:58,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:58,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-01-10 07:54:58,885 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-01-10 07:54:58,885 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:58,885 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:54:59,012 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:54:59,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:54:59,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309584210]
[2025-01-10 07:54:59,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309584210] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:54:59,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:54:59,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-10 07:54:59,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656118158]
[2025-01-10 07:54:59,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:54:59,014 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:54:59,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:54:59,034 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-10 07:54:59,035 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-10 07:54:59,037 INFO  L87              Difference]: Start difference. First operand  has 118 states, 117 states have (on average 1.7692307692307692) internal successors, (207), 117 states have internal predecessors, (207), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:54:59,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:54:59,098 INFO  L93              Difference]: Finished difference Result 120 states and 207 transitions.
[2025-01-10 07:54:59,099 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 207 transitions.
[2025-01-10 07:54:59,106 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 56
[2025-01-10 07:54:59,117 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 113 states and 192 transitions.
[2025-01-10 07:54:59,120 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 113
[2025-01-10 07:54:59,121 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 113
[2025-01-10 07:54:59,121 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 113 states and 192 transitions.
[2025-01-10 07:54:59,122 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:54:59,123 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 113 states and 192 transitions.
[2025-01-10 07:54:59,130 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states and 192 transitions.
[2025-01-10 07:54:59,144 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2025-01-10 07:54:59,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 113 states have (on average 1.6991150442477876) internal successors, (192), 112 states have internal predecessors, (192), 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:54:59,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 192 transitions.
[2025-01-10 07:54:59,147 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 113 states and 192 transitions.
[2025-01-10 07:54:59,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-10 07:54:59,150 INFO  L432   stractBuchiCegarLoop]: Abstraction has 113 states and 192 transitions.
[2025-01-10 07:54:59,150 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-01-10 07:54:59,150 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 192 transitions.
[2025-01-10 07:54:59,152 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 56
[2025-01-10 07:54:59,152 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:54:59,152 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:54:59,153 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:59,153 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:59,153 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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0;" "init_#res#1 := init_~tmp___5~0#1;" "main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" 
[2025-01-10 07:54:59,153 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" 
[2025-01-10 07:54:59,154 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:59,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times
[2025-01-10 07:54:59,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:59,154 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633946325]
[2025-01-10 07:54:59,154 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:54:59,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:59,165 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes.
[2025-01-10 07:54:59,178 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-01-10 07:54:59,178 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-10 07:54:59,178 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:54:59,253 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:54:59,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:54:59,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633946325]
[2025-01-10 07:54:59,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633946325] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:54:59,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:54:59,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-10 07:54:59,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880537813]
[2025-01-10 07:54:59,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:54:59,254 INFO  L757   eck$LassoCheckResult]: stem already infeasible
[2025-01-10 07:54:59,254 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:59,254 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945585109, now seen corresponding path program 1 times
[2025-01-10 07:54:59,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:59,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166657997]
[2025-01-10 07:54:59,255 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:54:59,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:59,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-01-10 07:54:59,305 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-01-10 07:54:59,306 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:59,306 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:54:59,341 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:54:59,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:54:59,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166657997]
[2025-01-10 07:54:59,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166657997] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:54:59,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:54:59,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-01-10 07:54:59,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987787259]
[2025-01-10 07:54:59,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:54:59,341 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:54:59,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:54:59,342 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-10 07:54:59,342 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-10 07:54:59,342 INFO  L87              Difference]: Start difference. First operand 113 states and 192 transitions. cyclomatic complexity: 80 Second operand  has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:54:59,466 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:54:59,470 INFO  L93              Difference]: Finished difference Result 172 states and 284 transitions.
[2025-01-10 07:54:59,470 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 284 transitions.
[2025-01-10 07:54:59,472 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 56
[2025-01-10 07:54:59,473 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 169 states and 255 transitions.
[2025-01-10 07:54:59,476 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 169
[2025-01-10 07:54:59,477 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 169
[2025-01-10 07:54:59,477 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 169 states and 255 transitions.
[2025-01-10 07:54:59,478 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:54:59,479 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 169 states and 255 transitions.
[2025-01-10 07:54:59,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169 states and 255 transitions.
[2025-01-10 07:54:59,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113.
[2025-01-10 07:54:59,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 112 states have internal predecessors, (165), 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:54:59,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions.
[2025-01-10 07:54:59,486 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 113 states and 165 transitions.
[2025-01-10 07:54:59,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-10 07:54:59,487 INFO  L432   stractBuchiCegarLoop]: Abstraction has 113 states and 165 transitions.
[2025-01-10 07:54:59,487 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-01-10 07:54:59,487 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 165 transitions.
[2025-01-10 07:54:59,488 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 56
[2025-01-10 07:54:59,488 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:54:59,488 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:54:59,489 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:59,491 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:59,491 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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;" "assume ~id1~0 >= 0;" "assume ~id2~0 >= 0;" "assume ~id3~0 >= 0;" "assume 0 == ~r1~0;" "assume 0 == ~r2~0;" "assume 0 == ~r3~0;" "assume 0 != init_~r122~0#1 % 256;" "assume 0 != init_~r132~0#1 % 256;" "assume 0 != init_~r212~0#1 % 256;" "assume 0 != init_~r232~0#1 % 256;" "assume 0 != init_~r312~0#1 % 256;" "assume 0 != init_~r322~0#1 % 256;" "assume ~max1~0 == ~id1~0;" "assume ~max2~0 == ~id2~0;" "assume ~max3~0 == ~id3~0;" "assume 0 == ~st1~0;" "assume 0 == ~st2~0;" "assume 0 == ~st3~0;" "assume 0 == ~nl1~0;" "assume 0 == ~nl2~0;" "assume 0 == ~nl3~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1;" "init_#res#1 := init_~tmp___5~0#1;" "main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" 
[2025-01-10 07:54:59,491 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" 
[2025-01-10 07:54:59,492 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:59,492 INFO  L85        PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times
[2025-01-10 07:54:59,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:59,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685176685]
[2025-01-10 07:54:59,492 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:54:59,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:59,501 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-01-10 07:54:59,552 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-01-10 07:54:59,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:59,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:54:59,552 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:54:59,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-01-10 07:54:59,637 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-01-10 07:54:59,641 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:59,641 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:54:59,665 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:54:59,666 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:59,666 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945585109, now seen corresponding path program 2 times
[2025-01-10 07:54:59,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:59,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614763264]
[2025-01-10 07:54:59,666 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:54:59,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:59,673 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes.
[2025-01-10 07:54:59,675 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-01-10 07:54:59,675 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-10 07:54:59,675 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:54:59,702 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:54:59,702 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:54:59,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614763264]
[2025-01-10 07:54:59,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614763264] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:54:59,702 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:54:59,702 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-01-10 07:54:59,702 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727818104]
[2025-01-10 07:54:59,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:54:59,702 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:54:59,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:54:59,703 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-10 07:54:59,703 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-10 07:54:59,703 INFO  L87              Difference]: Start difference. First operand 113 states and 165 transitions. cyclomatic complexity: 53 Second operand  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-10 07:54:59,745 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:54:59,745 INFO  L93              Difference]: Finished difference Result 157 states and 230 transitions.
[2025-01-10 07:54:59,745 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 230 transitions.
[2025-01-10 07:54:59,746 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 100
[2025-01-10 07:54:59,747 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 157 states and 230 transitions.
[2025-01-10 07:54:59,747 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 157
[2025-01-10 07:54:59,747 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 157
[2025-01-10 07:54:59,747 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 157 states and 230 transitions.
[2025-01-10 07:54:59,748 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:54:59,748 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 157 states and 230 transitions.
[2025-01-10 07:54:59,748 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 157 states and 230 transitions.
[2025-01-10 07:54:59,752 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157.
[2025-01-10 07:54:59,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157 states, 157 states have (on average 1.464968152866242) internal successors, (230), 156 states have internal predecessors, (230), 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:54:59,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 230 transitions.
[2025-01-10 07:54:59,753 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 157 states and 230 transitions.
[2025-01-10 07:54:59,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-10 07:54:59,755 INFO  L432   stractBuchiCegarLoop]: Abstraction has 157 states and 230 transitions.
[2025-01-10 07:54:59,755 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-01-10 07:54:59,755 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 230 transitions.
[2025-01-10 07:54:59,756 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 100
[2025-01-10 07:54:59,756 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:54:59,756 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:54:59,757 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:59,757 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:54:59,757 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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;" "assume ~id1~0 >= 0;" "assume ~id2~0 >= 0;" "assume ~id3~0 >= 0;" "assume 0 == ~r1~0;" "assume 0 == ~r2~0;" "assume 0 == ~r3~0;" "assume 0 != init_~r122~0#1 % 256;" "assume 0 != init_~r132~0#1 % 256;" "assume 0 != init_~r212~0#1 % 256;" "assume 0 != init_~r232~0#1 % 256;" "assume 0 != init_~r312~0#1 % 256;" "assume 0 != init_~r322~0#1 % 256;" "assume ~max1~0 == ~id1~0;" "assume ~max2~0 == ~id2~0;" "assume ~max3~0 == ~id3~0;" "assume 0 == ~st1~0;" "assume 0 == ~st2~0;" "assume 0 == ~st3~0;" "assume 0 == ~nl1~0;" "assume 0 == ~nl2~0;" "assume 0 == ~nl3~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1;" "init_#res#1 := init_~tmp___5~0#1;" "main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" 
[2025-01-10 07:54:59,757 INFO  L754   eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 2;" "assume !(0 != ~ep12~0 % 256);" "assume 0 != ~ep13~0 % 256;~p13_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 - 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume !(~r1~0 >= 2);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 2;" "assume !(~r1~0 >= 2);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" 
[2025-01-10 07:54:59,758 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:59,758 INFO  L85        PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times
[2025-01-10 07:54:59,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:59,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813124138]
[2025-01-10 07:54:59,758 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:54:59,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:59,770 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes.
[2025-01-10 07:54:59,815 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-01-10 07:54:59,815 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-10 07:54:59,815 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:54:59,815 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:54:59,821 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-01-10 07:54:59,873 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-01-10 07:54:59,873 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:59,873 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:54:59,880 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:54:59,881 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:59,881 INFO  L85        PathProgramCache]: Analyzing trace with hash -440211541, now seen corresponding path program 1 times
[2025-01-10 07:54:59,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:59,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048214849]
[2025-01-10 07:54:59,881 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:54:59,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:59,885 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-01-10 07:54:59,888 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-01-10 07:54:59,888 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:59,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:54:59,889 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:54:59,890 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-01-10 07:54:59,893 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-01-10 07:54:59,893 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:59,893 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:54:59,895 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:54:59,896 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:54:59,896 INFO  L85        PathProgramCache]: Analyzing trace with hash 512236141, now seen corresponding path program 1 times
[2025-01-10 07:54:59,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:54:59,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170941091]
[2025-01-10 07:54:59,896 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:54:59,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:54:59,907 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-01-10 07:54:59,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-01-10 07:54:59,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:54:59,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:54:59,972 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:54:59,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:54:59,972 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170941091]
[2025-01-10 07:54:59,972 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170941091] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:54:59,972 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:54:59,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-01-10 07:54:59,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817731170]
[2025-01-10 07:54:59,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:55:01,056 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:55:01,057 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:55:01,057 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:55:01,057 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:55:01,057 INFO  L128   ssoRankerPreferences]: Use exernal solver: true
[2025-01-10 07:55:01,057 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:01,057 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:55:01,057 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:55:01,057 INFO  L132   ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop
[2025-01-10 07:55:01,057 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:55:01,057 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:55:01,103 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,111 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,117 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,119 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,124 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,128 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,130 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,142 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,147 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,151 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,353 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,355 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,359 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,362 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,366 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,367 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,369 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:01,750 WARN  L137   XnfTransformerHelper]: expecting exponential blowup for input size 6
[2025-01-10 07:55:02,893 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:55:02,893 INFO  L365          LassoAnalysis]: Checking for nontermination...
[2025-01-10 07:55:02,895 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:02,895 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:02,900 INFO  L229       MonitoredProcess]: Starting monitored process 2 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:55:02,901 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2025-01-10 07:55:02,904 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:55:02,904 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:55:02,931 INFO  L398          LassoAnalysis]: Proved nontermination for one component.
[2025-01-10 07:55:02,931 INFO  L401          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2025-01-10 07:55:02,939 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0
[2025-01-10 07:55:02,939 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:02,939 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:02,941 INFO  L229       MonitoredProcess]: Starting monitored process 3 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:55:02,941 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2025-01-10 07:55:02,944 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2025-01-10 07:55:02,944 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:55:02,963 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0
[2025-01-10 07:55:02,964 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:02,964 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:02,966 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-01-10 07:55:02,967 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2025-01-10 07:55:02,969 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2025-01-10 07:55:02,969 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2025-01-10 07:55:03,043 INFO  L405          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2025-01-10 07:55:03,048 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2025-01-10 07:55:03,048 INFO  L204          LassoAnalysis]: Preferences:
[2025-01-10 07:55:03,048 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-01-10 07:55:03,049 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-01-10 07:55:03,049 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-01-10 07:55:03,049 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-01-10 07:55:03,049 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:03,049 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-01-10 07:55:03,049 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-01-10 07:55:03,049 INFO  L132   ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop
[2025-01-10 07:55:03,049 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-01-10 07:55:03,049 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-01-10 07:55:03,057 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,066 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,068 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,071 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,079 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,085 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,086 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,092 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,103 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,105 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,109 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,120 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,353 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,355 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,359 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,361 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,363 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-01-10 07:55:03,734 WARN  L137   XnfTransformerHelper]: expecting exponential blowup for input size 6
[2025-01-10 07:55:04,717 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-01-10 07:55:04,721 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-01-10 07:55:04,722 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:04,722 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:04,728 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:55:04,729 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:55:04,731 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:55:04,752 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:04,752 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:04,753 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:04,753 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:04,753 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:04,759 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:04,759 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:04,762 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:04,775 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2025-01-10 07:55:04,775 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:04,775 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:04,778 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:55:04,779 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:55:04,781 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:55:04,794 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:04,794 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:04,794 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:04,794 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:04,794 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:04,795 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:04,795 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:04,797 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:04,805 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:55:04,806 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:04,806 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:04,808 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:55:04,811 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:55:04,811 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:55:04,826 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:04,826 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:04,826 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:04,826 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:04,826 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:04,826 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:04,826 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:04,830 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:04,836 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:55:04,836 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:04,836 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:04,838 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:55:04,841 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:55:04,842 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:55:04,853 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:04,853 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:04,853 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:04,853 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:04,853 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:04,863 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:04,863 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:04,866 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:04,872 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:55:04,872 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:04,872 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:04,874 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:55:04,876 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:55:04,877 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-01-10 07:55:04,887 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:04,888 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:04,888 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:04,888 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:04,888 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:04,893 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:04,893 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:04,898 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:04,908 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0
[2025-01-10 07:55:04,913 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:04,913 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:04,916 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:55:04,917 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:55:04,919 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:55:04,932 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:04,932 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:04,932 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:04,932 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:04,932 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:04,933 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:04,933 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:04,934 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:04,942 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0
[2025-01-10 07:55:04,943 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:04,943 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:04,945 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:55:04,948 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:55:04,948 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-01-10 07:55:04,961 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:04,962 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:04,962 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:04,962 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:04,962 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:04,965 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:04,965 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:04,969 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:04,978 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2025-01-10 07:55:04,978 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:04,979 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:04,982 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:55:04,983 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:55:04,984 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:55:04,996 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:04,996 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:04,996 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:04,997 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:04,997 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:04,997 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:04,997 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:05,000 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:05,008 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0
[2025-01-10 07:55:05,008 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:05,008 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:05,011 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:55:05,012 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:55:05,014 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:55:05,026 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:05,026 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:05,026 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:05,026 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:05,026 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:05,027 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:05,027 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:05,029 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:05,038 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0
[2025-01-10 07:55:05,039 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:05,039 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:05,041 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:55:05,043 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:55:05,044 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:55:05,056 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:05,056 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:05,056 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:05,056 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:05,056 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:05,056 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:05,056 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:05,058 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:05,066 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:55:05,066 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:05,066 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:05,070 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:55:05,071 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:55:05,071 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:55:05,082 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:05,082 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:05,083 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:05,083 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:05,083 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:05,083 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:05,083 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:05,085 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:05,091 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0
[2025-01-10 07:55:05,091 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:05,091 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:05,093 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:55:05,094 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:55:05,095 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:55:05,106 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:05,106 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:05,106 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:05,106 INFO  L204   nArgumentSynthesizer]: 6 loop disjuncts
[2025-01-10 07:55:05,107 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:05,129 INFO  L401   nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications.
[2025-01-10 07:55:05,129 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:05,150 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:05,156 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:55:05,156 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:05,156 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:05,158 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:55:05,159 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:55:05,160 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-01-10 07:55:05,170 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:05,170 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:05,171 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:05,171 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:05,171 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:05,171 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:05,171 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:05,172 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-01-10 07:55:05,178 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0
[2025-01-10 07:55:05,178 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:05,178 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:05,180 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:55:05,181 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:55:05,182 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:55:05,192 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-01-10 07:55:05,192 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-01-10 07:55:05,192 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-01-10 07:55:05,192 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-01-10 07:55:05,192 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-01-10 07:55:05,193 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-01-10 07:55:05,193 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-01-10 07:55:05,195 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-01-10 07:55:05,197 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2025-01-10 07:55:05,199 INFO  L444   ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2025-01-10 07:55:05,200 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:55:05,200 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:55:05,202 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:55:05,203 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:55:05,204 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-01-10 07:55:05,204 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2025-01-10 07:55:05,204 INFO  L474          LassoAnalysis]: Proved termination.
[2025-01-10 07:55:05,204 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11
Supporting invariants []
[2025-01-10 07:55:05,210 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:55:05,212 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2025-01-10 07:55:05,250 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:55:05,292 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-01-10 07:55:05,322 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-01-10 07:55:05,322 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:55:05,322 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:55:05,324 INFO  L256         TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-10 07:55:05,325 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:55:05,401 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-01-10 07:55:05,409 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-01-10 07:55:05,410 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:55:05,410 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:55:05,410 INFO  L256         TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-01-10 07:55:05,411 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:55:05,503 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0
[2025-01-10 07:55:05,532 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:55:05,539 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:55:05,539 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 230 transitions. cyclomatic complexity: 74 Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:55:05,580 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 230 transitions. cyclomatic complexity: 74. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 256 states and 385 transitions. Complement of second has 4 states.
[2025-01-10 07:55:05,586 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:55:05,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:55:05,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions.
[2025-01-10 07:55:05,589 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 45 letters. Loop has 29 letters.
[2025-01-10 07:55:05,591 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:55:05,591 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 74 letters. Loop has 29 letters.
[2025-01-10 07:55:05,592 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:55:05,592 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 45 letters. Loop has 58 letters.
[2025-01-10 07:55:05,593 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-01-10 07:55:05,594 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 385 transitions.
[2025-01-10 07:55:05,596 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-01-10 07:55:05,597 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 0 states and 0 transitions.
[2025-01-10 07:55:05,597 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2025-01-10 07:55:05,597 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2025-01-10 07:55:05,597 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2025-01-10 07:55:05,597 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:55:05,597 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-10 07:55:05,597 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-10 07:55:05,597 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:55:05,598 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-10 07:55:05,598 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-10 07:55:05,598 INFO  L87              Difference]: Start difference. First operand 0 states and 0 transitions. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:55:05,598 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:55:05,598 INFO  L93              Difference]: Finished difference Result 0 states and 0 transitions.
[2025-01-10 07:55:05,598 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions.
[2025-01-10 07:55:05,598 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-01-10 07:55:05,598 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions.
[2025-01-10 07:55:05,598 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2025-01-10 07:55:05,598 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2025-01-10 07:55:05,598 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2025-01-10 07:55:05,598 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:55:05,598 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-10 07:55:05,598 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-10 07:55:05,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-01-10 07:55:05,598 INFO  L432   stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-10 07:55:05,598 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-01-10 07:55:05,598 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2025-01-10 07:55:05,599 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-01-10 07:55:05,599 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2025-01-10 07:55:05,606 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:55:05 BoogieIcfgContainer
[2025-01-10 07:55:05,608 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-01-10 07:55:05,608 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-01-10 07:55:05,609 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-01-10 07:55:05,609 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-01-10 07:55:05,609 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:54:58" (3/4) ...
[2025-01-10 07:55:05,611 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-01-10 07:55:05,612 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-01-10 07:55:05,612 INFO  L158              Benchmark]: Toolchain (without parser) took 8151.56ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 112.4MB in the beginning and 150.6MB in the end (delta: -38.2MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB.
[2025-01-10 07:55:05,612 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:55:05,612 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 300.50ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 96.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-01-10 07:55:05,613 INFO  L158              Benchmark]: Boogie Procedure Inliner took 74.13ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:55:05,613 INFO  L158              Benchmark]: Boogie Preprocessor took 71.07ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-10 07:55:05,613 INFO  L158              Benchmark]: RCFGBuilder took 486.35ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 56.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-01-10 07:55:05,613 INFO  L158              Benchmark]: BuchiAutomizer took 7211.00ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 56.3MB in the beginning and 150.6MB in the end (delta: -94.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:55:05,614 INFO  L158              Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 201.3MB. Free memory was 150.6MB in the beginning and 150.6MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:55:05,615 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.15ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 300.50ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 96.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 74.13ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 71.07ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * RCFGBuilder took 486.35ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 56.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 7211.00ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 56.3MB in the beginning and 150.6MB in the end (delta: -94.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 3.30ms. Allocated memory is still 201.3MB. Free memory was 150.6MB in the beginning and 150.6MB in the end (delta: 39.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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i2) + 11) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 7.1s and 5 iterations.  TraceHistogramMax:1. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 56 StatesRemovedByMinimization, 1 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 [1, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 2069 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1353 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 716 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks:   Lassos: inital241 mio100 ax100 hnf100 lsp288 ukn21 mio100 lsp100 div131 bol100 ite100 ukn100 eq174 hnf95 smp79 dnf1417 smp19 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms VariablesStem: 0 VariablesLoop: 24 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 1	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.1s	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:55:05,627 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