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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-10 07:51:03,284 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-10 07:51:03,339 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:51:03,343 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-10 07:51:03,343 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-10 07:51:03,368 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-10 07:51:03,368 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-10 07:51:03,368 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-10 07:51:03,369 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-10 07:51:03,369 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-10 07:51:03,370 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-10 07:51:03,370 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-10 07:51:03,370 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-10 07:51:03,370 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-01-10 07:51:03,371 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-10 07:51:03,371 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-10 07:51:03,372 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-10 07:51:03,372 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-10 07:51:03,372 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-10 07:51:03,373 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-10 07:51:03,373 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-01-10 07:51:03,373 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985
[2025-01-10 07:51:03,639 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-10 07:51:03,648 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-10 07:51:03,651 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-10 07:51:03,653 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-10 07:51:03,653 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-10 07:51:03,654 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c
[2025-01-10 07:51:04,894 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aafcb2660/cf5270dea75d4903be6ac862bee6c420/FLAGdd55dd978
[2025-01-10 07:51:05,121 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-10 07:51:05,122 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c
[2025-01-10 07:51:05,131 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aafcb2660/cf5270dea75d4903be6ac862bee6c420/FLAGdd55dd978
[2025-01-10 07:51:05,147 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aafcb2660/cf5270dea75d4903be6ac862bee6c420
[2025-01-10 07:51:05,149 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-10 07:51:05,151 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-10 07:51:05,153 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-10 07:51:05,154 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-10 07:51:05,157 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-10 07:51:05,158 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,159 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e27a866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05, skipping insertion in model container
[2025-01-10 07:51:05,159 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,170 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-10 07:51:05,266 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-10 07:51:05,273 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-10 07:51:05,284 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-10 07:51:05,294 INFO  L204         MainTranslator]: Completed translation
[2025-01-10 07:51:05,294 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05 WrapperNode
[2025-01-10 07:51:05,294 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-10 07:51:05,295 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-10 07:51:05,295 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-10 07:51:05,295 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-10 07:51:05,299 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:51:05" (1/1) ...
[2025-01-10 07:51:05,303 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:51:05" (1/1) ...
[2025-01-10 07:51:05,313 INFO  L138                Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53
[2025-01-10 07:51:05,313 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-10 07:51:05,314 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-10 07:51:05,314 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-10 07:51:05,314 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-10 07:51:05,319 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,319 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,321 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,329 INFO  L175           MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2].
[2025-01-10 07:51:05,330 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,330 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,337 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,338 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,339 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,340 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,341 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,342 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-10 07:51:05,343 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-10 07:51:05,343 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-10 07:51:05,343 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-10 07:51:05,348 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ...
[2025-01-10 07:51:05,353 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-01-10 07:51:05,361 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:51:05,376 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:51:05,385 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:51:05,403 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-10 07:51:05,403 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-10 07:51:05,403 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-01-10 07:51:05,403 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-01-10 07:51:05,403 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2025-01-10 07:51:05,403 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-01-10 07:51:05,404 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-01-10 07:51:05,404 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-01-10 07:51:05,404 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-01-10 07:51:05,404 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2025-01-10 07:51:05,404 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0
[2025-01-10 07:51:05,404 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0
[2025-01-10 07:51:05,404 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0
[2025-01-10 07:51:05,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0
[2025-01-10 07:51:05,405 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-10 07:51:05,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-10 07:51:05,405 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-01-10 07:51:05,405 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-01-10 07:51:05,405 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-01-10 07:51:05,405 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#3
[2025-01-10 07:51:05,405 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0
[2025-01-10 07:51:05,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0
[2025-01-10 07:51:05,405 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-01-10 07:51:05,478 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-10 07:51:05,479 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-10 07:51:05,662 INFO  L?                        ?]: Removed 9 outVars from TransFormulas that were not future-live.
[2025-01-10 07:51:05,662 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-10 07:51:05,669 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-10 07:51:05,669 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-01-10 07:51:05,669 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:51:05 BoogieIcfgContainer
[2025-01-10 07:51:05,670 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-10 07:51:05,670 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-01-10 07:51:05,671 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-01-10 07:51:05,675 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-01-10 07:51:05,675 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:51:05,675 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:51:05" (1/3) ...
[2025-01-10 07:51:05,676 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2db320ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:51:05, skipping insertion in model container
[2025-01-10 07:51:05,676 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:51:05,676 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (2/3) ...
[2025-01-10 07:51:05,677 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2db320ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:51:05, skipping insertion in model container
[2025-01-10 07:51:05,677 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-01-10 07:51:05,677 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:51:05" (3/3) ...
[2025-01-10 07:51:05,678 INFO  L363   chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c
[2025-01-10 07:51:05,716 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-01-10 07:51:05,716 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-01-10 07:51:05,717 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-01-10 07:51:05,717 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-01-10 07:51:05,717 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-01-10 07:51:05,717 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-01-10 07:51:05,717 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-01-10 07:51:05,717 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-01-10 07:51:05,723 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-01-10 07:51:05,743 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:05,743 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:51:05,744 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:51:05,748 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:51:05,749 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:51:05,749 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-01-10 07:51:05,749 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-01-10 07:51:05,751 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:05,751 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:51:05,751 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:51:05,751 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:51:05,751 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:51:05,756 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-01-10 07:51:05,757 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#70#return;" "call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-01-10 07:51:05,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:05,760 INFO  L85        PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 1 times
[2025-01-10 07:51:05,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:05,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965965546]
[2025-01-10 07:51:05,765 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:51:05,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:05,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:05,840 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:05,840 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:05,840 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:05,841 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:51:05,845 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:05,857 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:05,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:05,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:05,875 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:51:05,878 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:05,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -1113047060, now seen corresponding path program 1 times
[2025-01-10 07:51:05,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:05,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118696495]
[2025-01-10 07:51:05,878 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:51:05,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:05,891 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-01-10 07:51:05,901 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-01-10 07:51:05,902 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:05,902 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:06,178 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:51:06,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:51:06,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118696495]
[2025-01-10 07:51:06,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118696495] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:51:06,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:51:06,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-10 07:51:06,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656039152]
[2025-01-10 07:51:06,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:51:06,183 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:51:06,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:51:06,205 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-10 07:51:06,205 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-01-10 07:51:06,207 INFO  L87              Difference]: Start difference. First operand  has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand  has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-01-10 07:51:06,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:51:06,382 INFO  L93              Difference]: Finished difference Result 35 states and 43 transitions.
[2025-01-10 07:51:06,383 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions.
[2025-01-10 07:51:06,385 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:06,390 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 26 transitions.
[2025-01-10 07:51:06,392 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 22
[2025-01-10 07:51:06,392 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 22
[2025-01-10 07:51:06,397 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions.
[2025-01-10 07:51:06,398 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:51:06,398 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions.
[2025-01-10 07:51:06,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions.
[2025-01-10 07:51:06,431 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2025-01-10 07:51:06,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5)
[2025-01-10 07:51:06,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions.
[2025-01-10 07:51:06,435 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions.
[2025-01-10 07:51:06,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-10 07:51:06,438 INFO  L432   stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions.
[2025-01-10 07:51:06,438 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-01-10 07:51:06,438 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions.
[2025-01-10 07:51:06,439 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:06,439 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:51:06,439 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:51:06,439 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:51:06,439 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:51:06,439 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-01-10 07:51:06,440 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#66#return;" "assume true;" >"#70#return;" "call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-01-10 07:51:06,440 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:06,440 INFO  L85        PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 2 times
[2025-01-10 07:51:06,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:06,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146549506]
[2025-01-10 07:51:06,440 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:51:06,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:06,449 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:06,459 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:06,459 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-10 07:51:06,459 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:06,459 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:51:06,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:06,468 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:06,469 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:06,469 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:06,471 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:51:06,472 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:06,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -1122494970, now seen corresponding path program 1 times
[2025-01-10 07:51:06,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:06,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771507617]
[2025-01-10 07:51:06,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:51:06,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:06,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-01-10 07:51:06,485 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-01-10 07:51:06,485 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:06,485 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:06,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-01-10 07:51:06,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:51:06,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771507617]
[2025-01-10 07:51:06,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771507617] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-10 07:51:06,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-10 07:51:06,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-10 07:51:06,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768076783]
[2025-01-10 07:51:06,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-10 07:51:06,740 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:51:06,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:51:06,740 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-10 07:51:06,740 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-01-10 07:51:06,741 INFO  L87              Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand  has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3)
[2025-01-10 07:51:06,790 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:51:06,791 INFO  L93              Difference]: Finished difference Result 24 states and 28 transitions.
[2025-01-10 07:51:06,791 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions.
[2025-01-10 07:51:06,791 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:06,792 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions.
[2025-01-10 07:51:06,792 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 24
[2025-01-10 07:51:06,792 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2025-01-10 07:51:06,792 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions.
[2025-01-10 07:51:06,792 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:51:06,792 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-01-10 07:51:06,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions.
[2025-01-10 07:51:06,794 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2025-01-10 07:51:06,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-01-10 07:51:06,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions.
[2025-01-10 07:51:06,794 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-01-10 07:51:06,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-10 07:51:06,799 INFO  L432   stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-01-10 07:51:06,799 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-01-10 07:51:06,799 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions.
[2025-01-10 07:51:06,799 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:06,799 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:51:06,799 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:51:06,800 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:51:06,800 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:51:06,800 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-01-10 07:51:06,800 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#66#return;" "assume true;" >"#70#return;" "call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-01-10 07:51:06,800 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:06,800 INFO  L85        PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 3 times
[2025-01-10 07:51:06,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:06,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373799478]
[2025-01-10 07:51:06,801 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-10 07:51:06,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:06,814 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:06,821 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:06,821 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-01-10 07:51:06,821 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:06,821 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:51:06,823 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:06,830 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:06,830 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:06,830 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:06,835 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:51:06,835 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:06,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -1944809856, now seen corresponding path program 1 times
[2025-01-10 07:51:06,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:06,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819964281]
[2025-01-10 07:51:06,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:51:06,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:06,843 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-01-10 07:51:06,849 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-01-10 07:51:06,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:06,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:07,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-01-10 07:51:07,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:51:07,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819964281]
[2025-01-10 07:51:07,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819964281] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-10 07:51:07,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650970723]
[2025-01-10 07:51:07,119 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-10 07:51:07,119 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-10 07:51:07,120 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:51:07,125 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-10 07:51:07,126 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-01-10 07:51:07,172 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-01-10 07:51:07,195 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-01-10 07:51:07,195 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:07,196 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:07,198 INFO  L256         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-01-10 07:51:07,200 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:51:07,223 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2025-01-10 07:51:07,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-01-10 07:51:07,404 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-10 07:51:07,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-01-10 07:51:07,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650970723] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-10 07:51:07,784 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-10 07:51:07,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24
[2025-01-10 07:51:07,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077040321]
[2025-01-10 07:51:07,784 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-10 07:51:07,784 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:51:07,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:51:07,785 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-01-10 07:51:07,785 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552
[2025-01-10 07:51:07,785 INFO  L87              Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand  has 24 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 20 states have internal predecessors, (35), 10 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11)
[2025-01-10 07:51:08,135 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:51:08,136 INFO  L93              Difference]: Finished difference Result 28 states and 32 transitions.
[2025-01-10 07:51:08,136 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions.
[2025-01-10 07:51:08,137 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:08,137 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions.
[2025-01-10 07:51:08,137 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 28
[2025-01-10 07:51:08,138 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 28
[2025-01-10 07:51:08,138 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions.
[2025-01-10 07:51:08,138 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:51:08,138 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-01-10 07:51:08,138 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions.
[2025-01-10 07:51:08,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2025-01-10 07:51:08,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8)
[2025-01-10 07:51:08,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions.
[2025-01-10 07:51:08,140 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-01-10 07:51:08,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-01-10 07:51:08,141 INFO  L432   stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-01-10 07:51:08,141 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-01-10 07:51:08,141 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions.
[2025-01-10 07:51:08,142 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:08,142 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:51:08,142 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:51:08,143 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:51:08,143 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:51:08,143 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-01-10 07:51:08,143 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#66#return;" "assume true;" >"#66#return;" "assume true;" >"#70#return;" "call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-01-10 07:51:08,144 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:08,144 INFO  L85        PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 4 times
[2025-01-10 07:51:08,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:08,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028636162]
[2025-01-10 07:51:08,144 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-01-10 07:51:08,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:08,150 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes.
[2025-01-10 07:51:08,168 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:08,169 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-01-10 07:51:08,169 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:08,169 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:51:08,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:08,177 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:08,177 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:08,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:08,183 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:51:08,184 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:08,184 INFO  L85        PathProgramCache]: Analyzing trace with hash 1306331242, now seen corresponding path program 2 times
[2025-01-10 07:51:08,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:08,184 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481185473]
[2025-01-10 07:51:08,184 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:51:08,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:08,204 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes.
[2025-01-10 07:51:08,226 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements.
[2025-01-10 07:51:08,226 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-10 07:51:08,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:08,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-01-10 07:51:08,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:51:08,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481185473]
[2025-01-10 07:51:08,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481185473] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-10 07:51:08,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316635555]
[2025-01-10 07:51:08,665 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-10 07:51:08,665 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-10 07:51:08,665 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:51:08,669 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-10 07:51:08,671 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-01-10 07:51:08,719 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes.
[2025-01-10 07:51:08,751 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements.
[2025-01-10 07:51:08,751 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-10 07:51:08,751 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:08,753 INFO  L256         TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 50 conjuncts are in the unsatisfiable core
[2025-01-10 07:51:08,756 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:51:08,778 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2025-01-10 07:51:08,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-01-10 07:51:08,950 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-10 07:51:09,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-01-10 07:51:09,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316635555] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-10 07:51:09,720 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-10 07:51:09,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 29
[2025-01-10 07:51:09,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576390712]
[2025-01-10 07:51:09,721 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-10 07:51:09,721 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:51:09,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:51:09,721 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-01-10 07:51:09,722 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812
[2025-01-10 07:51:09,722 INFO  L87              Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand  has 29 states, 21 states have (on average 2.238095238095238) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17)
[2025-01-10 07:51:09,982 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:51:09,983 INFO  L93              Difference]: Finished difference Result 32 states and 36 transitions.
[2025-01-10 07:51:09,983 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions.
[2025-01-10 07:51:09,984 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:09,985 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions.
[2025-01-10 07:51:09,985 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 32
[2025-01-10 07:51:09,985 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 32
[2025-01-10 07:51:09,985 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions.
[2025-01-10 07:51:09,985 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:51:09,985 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions.
[2025-01-10 07:51:09,986 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions.
[2025-01-10 07:51:09,987 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-01-10 07:51:09,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10)
[2025-01-10 07:51:09,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions.
[2025-01-10 07:51:09,988 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions.
[2025-01-10 07:51:09,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-01-10 07:51:09,988 INFO  L432   stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions.
[2025-01-10 07:51:09,989 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-01-10 07:51:09,989 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions.
[2025-01-10 07:51:09,989 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:09,989 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:51:09,989 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:51:09,990 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:51:09,990 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:51:09,991 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-01-10 07:51:09,991 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#66#return;" "assume true;" >"#66#return;" "assume true;" >"#70#return;" "call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-01-10 07:51:09,991 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:09,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 5 times
[2025-01-10 07:51:09,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:09,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133053077]
[2025-01-10 07:51:09,991 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-01-10 07:51:09,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:09,995 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:09,999 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:09,999 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-10 07:51:09,999 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:09,999 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:51:10,001 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:10,003 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:10,003 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:10,003 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:10,005 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:51:10,006 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:10,006 INFO  L85        PathProgramCache]: Analyzing trace with hash -909942614, now seen corresponding path program 3 times
[2025-01-10 07:51:10,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:10,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376688374]
[2025-01-10 07:51:10,006 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-10 07:51:10,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:10,022 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 7 equivalence classes.
[2025-01-10 07:51:10,038 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 71 statements.
[2025-01-10 07:51:10,039 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-01-10 07:51:10,039 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:10,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 223 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked.
[2025-01-10 07:51:10,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:51:10,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376688374]
[2025-01-10 07:51:10,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376688374] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-10 07:51:10,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128468541]
[2025-01-10 07:51:10,399 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-10 07:51:10,399 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-10 07:51:10,399 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:51:10,402 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-10 07:51:10,404 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-01-10 07:51:10,457 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 7 equivalence classes.
[2025-01-10 07:51:10,482 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 71 statements.
[2025-01-10 07:51:10,482 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-01-10 07:51:10,482 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:10,483 INFO  L256         TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 40 conjuncts are in the unsatisfiable core
[2025-01-10 07:51:10,487 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:51:10,490 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2025-01-10 07:51:10,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked.
[2025-01-10 07:51:10,779 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-10 07:51:11,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked.
[2025-01-10 07:51:11,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128468541] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-10 07:51:11,821 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-10 07:51:11,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 28
[2025-01-10 07:51:11,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860323594]
[2025-01-10 07:51:11,822 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-10 07:51:11,822 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:51:11,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:51:11,822 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-01-10 07:51:11,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756
[2025-01-10 07:51:11,823 INFO  L87              Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand  has 28 states, 21 states have (on average 1.619047619047619) internal successors, (34), 24 states have internal predecessors, (34), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14)
[2025-01-10 07:51:12,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:51:12,331 INFO  L93              Difference]: Finished difference Result 36 states and 40 transitions.
[2025-01-10 07:51:12,331 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions.
[2025-01-10 07:51:12,332 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:12,332 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions.
[2025-01-10 07:51:12,332 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 36
[2025-01-10 07:51:12,333 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 36
[2025-01-10 07:51:12,333 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions.
[2025-01-10 07:51:12,333 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:51:12,333 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions.
[2025-01-10 07:51:12,333 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions.
[2025-01-10 07:51:12,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2025-01-10 07:51:12,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12)
[2025-01-10 07:51:12,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions.
[2025-01-10 07:51:12,337 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions.
[2025-01-10 07:51:12,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-01-10 07:51:12,338 INFO  L432   stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions.
[2025-01-10 07:51:12,338 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-01-10 07:51:12,338 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions.
[2025-01-10 07:51:12,339 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:12,341 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:51:12,341 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:51:12,343 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:51:12,343 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:51:12,343 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-01-10 07:51:12,344 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#66#return;" "assume true;" >"#66#return;" "assume true;" >"#66#return;" "assume true;" >"#66#return;" "assume true;" >"#70#return;" "call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-01-10 07:51:12,344 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:12,344 INFO  L85        PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 6 times
[2025-01-10 07:51:12,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:12,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48739167]
[2025-01-10 07:51:12,346 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-01-10 07:51:12,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:12,350 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:12,353 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:12,353 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2025-01-10 07:51:12,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:12,353 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:51:12,354 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:12,356 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:12,356 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:12,356 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:12,358 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:51:12,358 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:12,358 INFO  L85        PathProgramCache]: Analyzing trace with hash 387394152, now seen corresponding path program 4 times
[2025-01-10 07:51:12,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:12,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602551355]
[2025-01-10 07:51:12,358 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-01-10 07:51:12,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:12,375 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 133 statements into 2 equivalence classes.
[2025-01-10 07:51:12,392 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-01-10 07:51:12,392 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-01-10 07:51:12,393 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:13,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 938 backedges. 14 proven. 381 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked.
[2025-01-10 07:51:13,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-10 07:51:13,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602551355]
[2025-01-10 07:51:13,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602551355] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-10 07:51:13,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043008015]
[2025-01-10 07:51:13,592 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-01-10 07:51:13,593 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-10 07:51:13,593 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-10 07:51:13,595 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-10 07:51:13,597 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-01-10 07:51:13,662 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 133 statements into 2 equivalence classes.
[2025-01-10 07:51:13,756 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-01-10 07:51:13,756 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-01-10 07:51:13,756 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:13,761 INFO  L256         TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 96 conjuncts are in the unsatisfiable core
[2025-01-10 07:51:13,765 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-10 07:51:13,803 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2025-01-10 07:51:14,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 938 backedges. 359 proven. 24 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked.
[2025-01-10 07:51:14,162 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-10 07:51:16,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 938 backedges. 8 proven. 403 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked.
[2025-01-10 07:51:16,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043008015] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-10 07:51:16,333 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-10 07:51:16,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 22] total 39
[2025-01-10 07:51:16,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23745050]
[2025-01-10 07:51:16,333 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-10 07:51:16,333 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-01-10 07:51:16,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-10 07:51:16,334 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2025-01-10 07:51:16,334 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482
[2025-01-10 07:51:16,335 INFO  L87              Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand  has 39 states, 29 states have (on average 1.896551724137931) internal successors, (55), 33 states have internal predecessors, (55), 12 states have call successors, (19), 8 states have call predecessors, (19), 13 states have return successors, (23), 11 states have call predecessors, (23), 12 states have call successors, (23)
[2025-01-10 07:51:16,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-10 07:51:16,723 INFO  L93              Difference]: Finished difference Result 40 states and 44 transitions.
[2025-01-10 07:51:16,723 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions.
[2025-01-10 07:51:16,724 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:16,724 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions.
[2025-01-10 07:51:16,725 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 40
[2025-01-10 07:51:16,725 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 40
[2025-01-10 07:51:16,725 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions.
[2025-01-10 07:51:16,725 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-01-10 07:51:16,725 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions.
[2025-01-10 07:51:16,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions.
[2025-01-10 07:51:16,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40.
[2025-01-10 07:51:16,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14)
[2025-01-10 07:51:16,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions.
[2025-01-10 07:51:16,728 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions.
[2025-01-10 07:51:16,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-01-10 07:51:16,729 INFO  L432   stractBuchiCegarLoop]: Abstraction has 40 states and 44 transitions.
[2025-01-10 07:51:16,729 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-01-10 07:51:16,729 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions.
[2025-01-10 07:51:16,729 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-01-10 07:51:16,730 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-01-10 07:51:16,730 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-01-10 07:51:16,732 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-01-10 07:51:16,732 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2025-01-10 07:51:16,732 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-01-10 07:51:16,732 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#62#return;" "assume true;" >"#64#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#66#return;" "assume true;" >"#66#return;" "assume true;" >"#66#return;" "assume true;" >"#66#return;" "assume true;" >"#70#return;" "call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-01-10 07:51:16,733 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:16,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 7 times
[2025-01-10 07:51:16,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:16,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846423499]
[2025-01-10 07:51:16,733 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-01-10 07:51:16,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:16,737 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:16,740 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:16,740 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:16,740 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:16,740 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-10 07:51:16,741 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-01-10 07:51:16,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-01-10 07:51:16,743 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-10 07:51:16,743 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-10 07:51:16,745 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-10 07:51:16,745 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-10 07:51:16,745 INFO  L85        PathProgramCache]: Analyzing trace with hash -1383958808, now seen corresponding path program 5 times
[2025-01-10 07:51:16,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-10 07:51:16,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730365835]
[2025-01-10 07:51:16,746 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-01-10 07:51:16,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-10 07:51:16,764 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 173 statements into 20 equivalence classes.
[2025-01-10 07:51:16,895 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 173 of 173 statements.
[2025-01-10 07:51:16,895 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s)
[2025-01-10 07:51:16,895 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-10 07:51:19,303 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception:
java.lang.AssertionError
	at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:395)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154)
	at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115)
	at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:871)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:795)
	at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343)
	at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:207)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.<init>(NestedInterpolantsBuilder.java:155)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:292)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:227)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.<init>(InterpolatingTraceCheckCraig.java:98)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:75)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.<init>(AutomatonFreeRefinementEngine.java:85)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:82)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:888)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:847)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.<init>(LassoCheck.java:767)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.<init>(LassoCheck.java:261)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:362)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:151)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:188)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:364)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
	at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2025-01-10 07:51:19,309 INFO  L158              Benchmark]: Toolchain (without parser) took 14158.21ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 134.7MB in the beginning and 555.7MB in the end (delta: -421.0MB). Peak memory consumption was 414.3MB. Max. memory is 16.1GB.
[2025-01-10 07:51:19,309 INFO  L158              Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:51:19,309 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 141.54ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 123.9MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-10 07:51:19,310 INFO  L158              Benchmark]: Boogie Procedure Inliner took 18.43ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 122.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-10 07:51:19,310 INFO  L158              Benchmark]: Boogie Preprocessor took 28.03ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-10 07:51:19,310 INFO  L158              Benchmark]: RCFGBuilder took 327.09ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 107.0MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-10 07:51:19,310 INFO  L158              Benchmark]: BuchiAutomizer took 13637.71ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 107.0MB in the beginning and 555.7MB in the end (delta: -448.7MB). Peak memory consumption was 389.1MB. Max. memory is 16.1GB.
[2025-01-10 07:51:19,312 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 141.54ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 123.9MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 18.43ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 122.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 28.03ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * RCFGBuilder took 327.09ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 107.0MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 13637.71ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 107.0MB in the beginning and 555.7MB in the end (delta: -448.7MB). Peak memory consumption was 389.1MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
  - ExceptionOrErrorResult: AssertionError: null
    de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2025-01-10 07:51:19,329 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-01-10 07:51:19,529 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-01-10 07:51:19,733 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-01-10 07:51:19,933 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-01-10 07:51:20,135 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
No suitable file found in config dir /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf
No suitable settings file found using Termination*32bit*_Bitvector
ERROR: UNSUPPORTED PROPERTY
Writing output log to file Ultimate.log
Result:
ERROR: ExceptionOrErrorResult: AssertionError: null