./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-798a7b3-m [2025-03-04 16:19:35,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:19:35,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:19:35,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:19:35,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:19:35,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:19:35,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:19:35,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:19:35,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:19:35,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:19:35,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:19:35,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:19:35,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:19:35,112 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:19:35,112 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:19:35,112 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:19:35,112 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:19:35,112 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:19:35,112 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:19:35,112 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:19:35,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:19:35,113 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:19:35,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:19:35,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:19:35,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:19:35,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:19:35,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:19:35,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:19:35,115 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:19:35,115 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/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-03-04 16:19:35,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:19:35,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:19:35,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:19:35,342 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:19:35,342 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:19:35,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-03-04 16:19:36,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4902daa26/8314a45b1aa64f4c802bfc6e150fd044/FLAGc7973da95 [2025-03-04 16:19:36,741 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:19:36,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-03-04 16:19:36,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4902daa26/8314a45b1aa64f4c802bfc6e150fd044/FLAGc7973da95 [2025-03-04 16:19:37,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4902daa26/8314a45b1aa64f4c802bfc6e150fd044 [2025-03-04 16:19:37,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:19:37,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:19:37,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:19:37,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:19:37,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:19:37,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e131198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37, skipping insertion in model container [2025-03-04 16:19:37,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:19:37,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:19:37,240 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:19:37,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:19:37,270 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:19:37,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37 WrapperNode [2025-03-04 16:19:37,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:19:37,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:19:37,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:19:37,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:19:37,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,296 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2025-03-04 16:19:37,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:19:37,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:19:37,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:19:37,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:19:37,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,323 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-03-04 16:19:37,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,327 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:19:37,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:19:37,332 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:19:37,332 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:19:37,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:37,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:37,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:37,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2025-03-04 16:19:37,376 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2025-03-04 16:19:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-03-04 16:19:37,376 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-03-04 16:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:19:37,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 16:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 16:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 16:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 16:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2025-03-04 16:19:37,377 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2025-03-04 16:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 16:19:37,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:19:37,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:19:37,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-04 16:19:37,618 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-04 16:19:37,618 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:19:37,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:19:37,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:19:37,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:19:37 BoogieIcfgContainer [2025-03-04 16:19:37,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:19:37,627 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:19:37,628 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:19:37,631 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:19:37,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:37,632 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:19:37" (1/3) ... [2025-03-04 16:19:37,633 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79dce2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:19:37, skipping insertion in model container [2025-03-04 16:19:37,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:37,634 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (2/3) ... [2025-03-04 16:19:37,634 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79dce2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:19:37, skipping insertion in model container [2025-03-04 16:19:37,634 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:37,634 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:19:37" (3/3) ... [2025-03-04 16:19:37,635 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c [2025-03-04 16:19:37,673 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:19:37,673 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:19:37,673 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:19:37,673 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:19:37,673 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:19:37,673 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:19:37,674 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:19:37,674 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:19:37,678 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-03-04 16:19:37,692 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:37,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:37,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:37,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:37,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:37,697 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:19:37,697 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-03-04 16:19:37,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:37,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:37,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:37,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:37,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:37,702 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#3(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#2(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#3(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-03-04 16:19:37,702 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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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-03-04 16:19:37,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 1 times [2025-03-04 16:19:37,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:37,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362161733] [2025-03-04 16:19:37,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:37,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:37,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:37,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:37,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:37,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:37,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:37,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:37,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:37,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:37,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash 880373472, now seen corresponding path program 1 times [2025-03-04 16:19:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:37,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277783001] [2025-03-04 16:19:37,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:37,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:37,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:19:37,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:19:37,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:37,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:19:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:38,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277783001] [2025-03-04 16:19:38,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277783001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:38,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:38,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:38,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991055804] [2025-03-04 16:19:38,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:38,084 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:38,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:38,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:38,103 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-03-04 16:19:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:38,218 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-04 16:19:38,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2025-03-04 16:19:38,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:38,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 26 transitions. [2025-03-04 16:19:38,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-04 16:19:38,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-04 16:19:38,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2025-03-04 16:19:38,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:38,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-04 16:19:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2025-03-04 16:19:38,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-04 16:19:38,249 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-03-04 16:19:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-04 16:19:38,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-04 16:19:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:38,257 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-04 16:19:38,258 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:19:38,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2025-03-04 16:19:38,259 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:38,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:38,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:38,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:38,261 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-03-04 16:19:38,261 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#3(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#2(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#3(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-03-04 16:19:38,261 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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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-03-04 16:19:38,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 2 times [2025-03-04 16:19:38,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:38,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35218850] [2025-03-04 16:19:38,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:38,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:38,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:38,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:38,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:38,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:38,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:38,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:38,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:38,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:38,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:38,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:38,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1255189484, now seen corresponding path program 1 times [2025-03-04 16:19:38,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:38,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274419495] [2025-03-04 16:19:38,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:38,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:38,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:19:38,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:19:38,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 16:19:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:38,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274419495] [2025-03-04 16:19:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274419495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:38,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392596217] [2025-03-04 16:19:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:38,506 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:38,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:38,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:38,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:38,508 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-03-04 16:19:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:38,573 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-04 16:19:38,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2025-03-04 16:19:38,575 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:38,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2025-03-04 16:19:38,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 16:19:38,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 16:19:38,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-03-04 16:19:38,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:38,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-04 16:19:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-03-04 16:19:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 16:19:38,579 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-03-04 16:19:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-03-04 16:19:38,583 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-04 16:19:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:38,584 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-04 16:19:38,584 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:19:38,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2025-03-04 16:19:38,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:38,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:38,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:38,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:38,585 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-03-04 16:19:38,585 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#3(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#2(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#3(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-03-04 16:19:38,585 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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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-03-04 16:19:38,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 3 times [2025-03-04 16:19:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:38,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595526031] [2025-03-04 16:19:38,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:38,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:38,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:38,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:19:38,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:38,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:38,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:38,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:38,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:38,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:38,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:38,603 INFO L85 PathProgramCache]: Analyzing trace with hash -837946947, now seen corresponding path program 1 times [2025-03-04 16:19:38,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:38,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472938997] [2025-03-04 16:19:38,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:38,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:38,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:19:38,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:19:38,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:19:38,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:38,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472938997] [2025-03-04 16:19:38,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472938997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:38,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857289499] [2025-03-04 16:19:38,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:38,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:38,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:38,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:38,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 16:19:38,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:19:38,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:19:38,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:38,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 16:19:38,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:39,000 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-03-04 16:19:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 16:19:39,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 16:19:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857289499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:39,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-03-04 16:19:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939550089] [2025-03-04 16:19:39,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:39,553 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:39,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 16:19:39,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-03-04 16:19:39,555 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-03-04 16:19:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:39,904 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-04 16:19:39,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2025-03-04 16:19:39,904 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:39,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 16:19:39,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-04 16:19:39,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-04 16:19:39,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2025-03-04 16:19:39,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:39,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 16:19:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2025-03-04 16:19:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 16:19:39,911 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-03-04 16:19:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 16:19:39,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 16:19:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 16:19:39,912 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 16:19:39,912 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:19:39,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2025-03-04 16:19:39,913 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:39,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:39,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:39,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:39,914 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-03-04 16:19:39,914 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#3(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#2(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#3(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-03-04 16:19:39,914 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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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-03-04 16:19:39,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 4 times [2025-03-04 16:19:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:39,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369482989] [2025-03-04 16:19:39,915 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:39,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:39,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 16:19:39,926 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:39,926 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:19:39,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:39,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:39,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:39,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:39,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:39,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:39,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash 364720792, now seen corresponding path program 2 times [2025-03-04 16:19:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:39,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979226782] [2025-03-04 16:19:39,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:39,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 16:19:39,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 16:19:39,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:19:39,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 16:19:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:40,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979226782] [2025-03-04 16:19:40,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979226782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:40,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391144629] [2025-03-04 16:19:40,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:40,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:40,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:40,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 16:19:40,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 16:19:40,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 16:19:40,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:19:40,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:40,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 16:19:40,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:40,594 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 15 treesize of output 1 [2025-03-04 16:19:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 16:19:40,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 16:19:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391144629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:41,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 29 [2025-03-04 16:19:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487509481] [2025-03-04 16:19:41,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:41,494 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:41,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 16:19:41,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-03-04 16:19:41,495 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-03-04 16:19:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:41,802 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-04 16:19:41,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2025-03-04 16:19:41,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:41,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2025-03-04 16:19:41,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-03-04 16:19:41,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-03-04 16:19:41,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2025-03-04 16:19:41,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:41,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-04 16:19:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2025-03-04 16:19:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 16:19:41,809 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-03-04 16:19:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-04 16:19:41,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-04 16:19:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 16:19:41,810 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-04 16:19:41,811 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:19:41,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2025-03-04 16:19:41,811 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:41,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:41,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:41,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:41,813 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-03-04 16:19:41,813 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#3(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#2(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#3(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-03-04 16:19:41,813 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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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-03-04 16:19:41,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 5 times [2025-03-04 16:19:41,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:41,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810762892] [2025-03-04 16:19:41,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:41,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:41,817 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:41,821 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:41,821 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:41,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:41,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:41,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:41,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:41,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:41,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:41,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:41,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash 493017176, now seen corresponding path program 3 times [2025-03-04 16:19:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453992658] [2025-03-04 16:19:41,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:41,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 7 equivalence classes. [2025-03-04 16:19:41,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 71 statements. [2025-03-04 16:19:41,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 16:19:41,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-04 16:19:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453992658] [2025-03-04 16:19:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453992658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:42,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322039021] [2025-03-04 16:19:42,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:42,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:42,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:42,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:42,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 16:19:42,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 7 equivalence classes. [2025-03-04 16:19:42,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 71 statements. [2025-03-04 16:19:42,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 16:19:42,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:42,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 16:19:42,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:42,252 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-03-04 16:19:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-04 16:19:42,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 16:19:42,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322039021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:42,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:42,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 28 [2025-03-04 16:19:42,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312458560] [2025-03-04 16:19:42,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:42,974 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:42,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 16:19:42,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2025-03-04 16:19:42,975 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-03-04 16:19:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:43,245 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-03-04 16:19:43,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2025-03-04 16:19:43,246 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:43,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2025-03-04 16:19:43,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-04 16:19:43,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-04 16:19:43,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2025-03-04 16:19:43,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:43,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-04 16:19:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2025-03-04 16:19:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 16:19:43,249 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-03-04 16:19:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-04 16:19:43,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-04 16:19:43,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 16:19:43,250 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-04 16:19:43,250 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:19:43,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2025-03-04 16:19:43,251 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:43,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:43,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:43,252 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:43,252 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-03-04 16:19:43,252 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#3(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#2(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#3(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-03-04 16:19:43,252 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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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-03-04 16:19:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 6 times [2025-03-04 16:19:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104895249] [2025-03-04 16:19:43,256 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:19:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:43,259 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:43,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:43,263 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:19:43,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:43,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:43,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:43,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:43,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:43,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:43,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:43,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1552868816, now seen corresponding path program 4 times [2025-03-04 16:19:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133207783] [2025-03-04 16:19:43,268 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:43,282 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 133 statements into 2 equivalence classes. [2025-03-04 16:19:43,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 16:19:43,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:19:43,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 14 proven. 381 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-04 16:19:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133207783] [2025-03-04 16:19:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133207783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449960042] [2025-03-04 16:19:44,395 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:44,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:44,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:44,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:44,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 16:19:44,489 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 133 statements into 2 equivalence classes. [2025-03-04 16:19:44,559 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 16:19:44,559 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:19:44,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:44,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 16:19:44,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:44,588 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 15 treesize of output 1 [2025-03-04 16:19:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 359 proven. 24 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 16:19:44,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 8 proven. 403 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-03-04 16:19:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449960042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:46,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:46,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 22] total 39 [2025-03-04 16:19:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835030610] [2025-03-04 16:19:46,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:46,515 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:46,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 16:19:46,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 16:19:46,517 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-03-04 16:19:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:46,850 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-03-04 16:19:46,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2025-03-04 16:19:46,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:46,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions. [2025-03-04 16:19:46,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-04 16:19:46,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-04 16:19:46,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2025-03-04 16:19:46,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:46,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-04 16:19:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2025-03-04 16:19:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 16:19:46,857 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-03-04 16:19:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-04 16:19:46,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-04 16:19:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 16:19:46,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-04 16:19:46,860 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:19:46,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2025-03-04 16:19:46,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:46,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:46,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:46,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:46,862 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-03-04 16:19:46,862 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#3(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#2(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#3(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-03-04 16:19:46,863 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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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-03-04 16:19:46,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 7 times [2025-03-04 16:19:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:46,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607324875] [2025-03-04 16:19:46,865 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:19:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:46,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:46,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:46,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:46,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:46,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:46,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:46,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:46,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:46,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:46,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:46,879 INFO L85 PathProgramCache]: Analyzing trace with hash 31853392, now seen corresponding path program 5 times [2025-03-04 16:19:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:46,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281524119] [2025-03-04 16:19:46,880 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:46,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:46,896 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 173 statements into 20 equivalence classes. [2025-03-04 16:19:47,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 16:19:47,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-04 16:19:47,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 1810 trivial. 0 not checked. [2025-03-04 16:19:48,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281524119] [2025-03-04 16:19:48,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281524119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128437181] [2025-03-04 16:19:48,141 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:48,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:48,143 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:48,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 16:19:48,227 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 173 statements into 20 equivalence classes. [2025-03-04 16:19:48,863 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 16:19:48,863 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-04 16:19:48,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:48,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 16:19:48,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:48,878 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-03-04 16:19:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2025-03-04 16:19:49,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2025-03-04 16:19:50,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128437181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:50,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:50,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 22] total 38 [2025-03-04 16:19:50,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617994937] [2025-03-04 16:19:50,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:50,190 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:50,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 16:19:50,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 16:19:50,192 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. cyclomatic complexity: 7 Second operand has 38 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-04 16:19:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:50,503 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-03-04 16:19:50,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2025-03-04 16:19:50,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:50,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 48 transitions. [2025-03-04 16:19:50,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-03-04 16:19:50,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-04 16:19:50,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2025-03-04 16:19:50,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:50,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-04 16:19:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2025-03-04 16:19:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 16:19:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 16:19:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-04 16:19:50,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-04 16:19:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 16:19:50,509 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-04 16:19:50,509 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:19:50,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2025-03-04 16:19:50,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:19:50,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:50,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:50,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:50,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:50,511 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#3(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#2(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#3(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-03-04 16:19:50,511 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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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-03-04 16:19:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 8 times [2025-03-04 16:19:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268162598] [2025-03-04 16:19:50,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:50,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:50,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:50,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:50,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:50,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:50,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:50,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:50,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:50,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:50,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:50,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash -791636088, now seen corresponding path program 6 times [2025-03-04 16:19:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419327246] [2025-03-04 16:19:50,522 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:19:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:50,557 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 255 statements into 43 equivalence classes. [2025-03-04 16:19:50,936 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 16:19:50,937 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2025-03-04 16:19:50,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:50,937 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:50,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 16:19:50,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 16:19:50,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:50,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:51,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:51,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:51,014 INFO L85 PathProgramCache]: Analyzing trace with hash -398289569, now seen corresponding path program 1 times [2025-03-04 16:19:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640906841] [2025-03-04 16:19:51,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:51,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-04 16:19:51,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-04 16:19:51,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:51,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:51,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:51,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-04 16:19:51,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-04 16:19:51,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:51,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:51,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:59,005 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:19:59,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:19:59,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:19:59,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:19:59,006 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:19:59,006 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,006 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:19:59,006 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:19:59,007 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration8_Lasso [2025-03-04 16:19:59,007 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:19:59,007 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:19:59,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:19:59,820 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:19:59,823 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:19:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:59,825 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:59,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:19:59,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:19:59,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:19:59,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:19:59,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:19:59,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:19:59,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:19:59,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:19:59,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:19:59,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:19:59,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 16:19:59,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:59,853 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:59,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 16:19:59,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:19:59,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:19:59,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:19:59,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:19:59,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:19:59,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:19:59,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:19:59,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:19:59,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:19:59,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 16:19:59,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:59,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:59,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 16:19:59,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:19:59,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:19:59,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:19:59,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:19:59,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:19:59,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:19:59,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:19:59,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:19:59,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:19:59,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 16:19:59,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:59,897 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:59,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 16:19:59,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:19:59,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:19:59,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:19:59,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:19:59,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:19:59,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:19:59,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:19:59,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:19:59,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:19:59,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 16:19:59,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:59,919 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:59,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 16:19:59,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:19:59,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:19:59,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:19:59,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:19:59,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:19:59,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:19:59,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:19:59,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:19:59,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:19:59,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 16:19:59,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:59,947 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:59,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 16:19:59,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:19:59,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:19:59,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:19:59,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:19:59,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:19:59,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:19:59,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:19:59,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:19:59,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:19:59,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 16:19:59,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:59,969 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:59,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 16:19:59,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:19:59,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:19:59,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:19:59,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:19:59,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:19:59,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:19:59,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:19:59,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:19:59,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:19:59,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 16:19:59,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:59,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,006 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 16:20:00,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:00,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:00,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:00,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:00,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,027 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 16:20:00,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 16:20:00,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,052 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 16:20:00,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 16:20:00,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,085 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 16:20:00,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 16:20:00,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,111 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:20:00,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:00,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,136 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:20:00,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 16:20:00,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,160 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 16:20:00,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:00,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,185 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:20:00,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:00,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,214 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 16:20:00,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 16:20:00,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,239 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 16:20:00,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:00,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,263 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 16:20:00,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:00,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:00,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:00,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:00,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:00,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:00,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:00,281 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:20:00,289 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 16:20:00,293 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-04 16:20:00,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:00,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:00,298 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:00,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 16:20:00,300 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:20:00,311 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:20:00,311 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:20:00,311 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1 + 11 Supporting invariants [] [2025-03-04 16:20:00,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:00,360 INFO L156 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2025-03-04 16:20:00,364 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 16:20:00,365 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 16:20:00,365 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2025-03-04 16:20:00,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:00,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:00,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:00,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:00,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:00,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:20:00,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:00,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 16:20:01,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 16:20:01,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:01,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-04 16:20:01,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:01,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 16:20:02,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2025-03-04 16:20:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked. [2025-03-04 16:20:02,223 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-04 16:20:02,226 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 16:20:02,354 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 131 states and 145 transitions. Complement of second has 19 states. [2025-03-04 16:20:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 16:20:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2025-03-04 16:20:02,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 255 letters. [2025-03-04 16:20:02,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:02,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 258 letters. Loop has 255 letters. [2025-03-04 16:20:02,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:02,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 510 letters. [2025-03-04 16:20:02,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:02,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2025-03-04 16:20:02,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:20:02,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 87 states and 99 transitions. [2025-03-04 16:20:02,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-04 16:20:02,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-03-04 16:20:02,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 99 transitions. [2025-03-04 16:20:02,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:20:02,377 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 99 transitions. [2025-03-04 16:20:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 99 transitions. [2025-03-04 16:20:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2025-03-04 16:20:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 21 states have return successors, (25), 22 states have call predecessors, (25), 8 states have call successors, (25) [2025-03-04 16:20:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2025-03-04 16:20:02,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 83 transitions. [2025-03-04 16:20:02,381 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2025-03-04 16:20:02,382 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:20:02,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2025-03-04 16:20:02,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:20:02,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:02,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:02,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:20:02,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:02,383 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#3(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#2(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#3(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);"< "~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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< [2025-03-04 16:20:02,383 INFO L754 eck$LassoCheckResult]: Loop: "~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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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);"< [2025-03-04 16:20:02,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1685787238, now seen corresponding path program 1 times [2025-03-04 16:20:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280206811] [2025-03-04 16:20:02,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:20:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:02,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:20:02,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:20:02,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:02,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:02,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:02,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:20:02,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:20:02,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:02,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:02,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:02,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1356371725, now seen corresponding path program 1 times [2025-03-04 16:20:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215443854] [2025-03-04 16:20:02,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:20:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:02,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 16:20:02,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:20:02,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:02,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:02,412 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:02,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 16:20:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:20:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:02,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:02,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash 794350, now seen corresponding path program 1 times [2025-03-04 16:20:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:02,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098857348] [2025-03-04 16:20:02,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:20:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:02,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 16:20:02,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 16:20:02,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:02,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:02,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:02,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 16:20:02,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 16:20:02,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:02,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:02,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:05,009 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:20:05,009 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:20:05,009 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:20:05,009 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:20:05,009 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:20:05,009 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,009 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:20:05,009 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:20:05,009 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration9_Lasso [2025-03-04 16:20:05,009 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:20:05,009 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:20:05,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:05,765 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:20:05,765 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:20:05,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,768 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 16:20:05,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 16:20:05,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,787 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 16:20:05,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 16:20:05,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,811 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 16:20:05,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:05,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,832 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 16:20:05,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 16:20:05,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,852 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 16:20:05,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 16:20:05,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,870 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 16:20:05,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:05,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,891 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 16:20:05,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 16:20:05,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,911 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 16:20:05,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:05,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,933 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 16:20:05,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 16:20:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,951 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 16:20:05,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 16:20:05,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,970 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 16:20:05,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:05,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:05,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:05,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:05,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:05,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:05,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:05,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:05,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:05,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 16:20:05,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:05,990 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:05,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 16:20:05,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:06,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:06,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:06,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 16:20:06,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,012 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 16:20:06,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:06,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:06,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:06,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 16:20:06,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,031 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 16:20:06,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:06,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,053 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 16:20:06,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 16:20:06,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,077 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 16:20:06,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:06,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:06,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:06,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 16:20:06,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,097 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 16:20:06,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 16:20:06,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,118 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 16:20:06,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:06,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,141 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 16:20:06,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:06,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,164 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 16:20:06,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 16:20:06,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,185 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 16:20:06,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-04 16:20:06,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,208 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 16:20:06,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-04 16:20:06,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,234 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 16:20:06,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:06,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,256 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 16:20:06,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 16:20:06,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,284 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 16:20:06,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:06,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 16:20:06,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,306 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 16:20:06,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:06,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:06,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:06,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:06,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:06,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:06,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:06,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:20:06,346 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-04 16:20:06,346 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 16:20:06,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:06,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:06,348 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:06,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 16:20:06,349 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:20:06,360 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-04 16:20:06,360 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:20:06,360 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1) = -2*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 + 13 Supporting invariants [1*v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 - 1*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 >= 0, -1*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 + 6 >= 0] [2025-03-04 16:20:06,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 16:20:06,404 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-04 16:20:06,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 16:20:06,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-03-04 16:20:06,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2025-03-04 16:20:06,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:06,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:20:06,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:20:06,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:06,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:06,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 16:20:06,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:06,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 16:20:06,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:20:06,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:06,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:06,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 16:20:06,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:06,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-04 16:20:06,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 16:20:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 16:20:06,805 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 5 loop predicates [2025-03-04 16:20:06,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14 Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:20:07,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 254 states and 287 transitions. Complement of second has 25 states. [2025-03-04 16:20:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:20:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2025-03-04 16:20:07,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 6 letters. Loop has 39 letters. [2025-03-04 16:20:07,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:07,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 45 letters. Loop has 39 letters. [2025-03-04 16:20:07,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:07,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 6 letters. Loop has 78 letters. [2025-03-04 16:20:07,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:07,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 287 transitions. [2025-03-04 16:20:07,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-03-04 16:20:07,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 155 states and 182 transitions. [2025-03-04 16:20:07,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-04 16:20:07,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-03-04 16:20:07,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 182 transitions. [2025-03-04 16:20:07,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:20:07,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 182 transitions. [2025-03-04 16:20:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 182 transitions. [2025-03-04 16:20:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2025-03-04 16:20:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 80 states have (on average 1.125) internal successors, (90), 88 states have internal predecessors, (90), 26 states have call successors, (26), 16 states have call predecessors, (26), 36 states have return successors, (50), 37 states have call predecessors, (50), 18 states have call successors, (50) [2025-03-04 16:20:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2025-03-04 16:20:07,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 166 transitions. [2025-03-04 16:20:07,016 INFO L432 stractBuchiCegarLoop]: Abstraction has 142 states and 166 transitions. [2025-03-04 16:20:07,016 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:20:07,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 166 transitions. [2025-03-04 16:20:07,019 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-03-04 16:20:07,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:07,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:07,019 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:07,019 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:20:07,020 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#3(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#2(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#3(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);"< "~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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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);"< [2025-03-04 16:20:07,020 INFO L754 eck$LassoCheckResult]: Loop: "~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);"< [2025-03-04 16:20:07,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash 235025028, now seen corresponding path program 1 times [2025-03-04 16:20:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608661655] [2025-03-04 16:20:07,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:20:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:07,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:20:07,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:20:07,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:07,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:07,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:07,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:20:07,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:20:07,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:07,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:07,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:07,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 32741, now seen corresponding path program 1 times [2025-03-04 16:20:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366602223] [2025-03-04 16:20:07,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:20:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:07,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:07,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:07,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:07,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:07,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:07,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:07,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:07,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:07,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash 833919618, now seen corresponding path program 1 times [2025-03-04 16:20:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011782866] [2025-03-04 16:20:07,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:20:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:07,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:20:07,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:20:07,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:07,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:07,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:07,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:20:07,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:20:07,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:07,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:07,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:08,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-04 16:20:08,755 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:20:08,755 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:20:08,755 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:20:08,755 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:20:08,755 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:20:08,755 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:08,755 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:20:08,755 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:20:08,755 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration10_Lasso [2025-03-04 16:20:08,755 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:20:08,755 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:20:08,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:08,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:09,260 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:20:09,260 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:20:09,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,262 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 16:20:09,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:09,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,285 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 16:20:09,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:09,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,305 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 16:20:09,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:09,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,326 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 16:20:09,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 16:20:09,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,346 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 16:20:09,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 16:20:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,365 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 16:20:09,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 16:20:09,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,384 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 16:20:09,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 16:20:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,403 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 16:20:09,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 16:20:09,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,423 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 16:20:09,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,442 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 16:20:09,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 16:20:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,461 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 16:20:09,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 16:20:09,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,481 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 16:20:09,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 16:20:09,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,500 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 16:20:09,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 16:20:09,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,519 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 16:20:09,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:09,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:09,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:09,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 16:20:09,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,539 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 16:20:09,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:09,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:09,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:09,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 16:20:09,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,559 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 16:20:09,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:09,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:09,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:09,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:09,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:09,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:09,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:09,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:20:09,591 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-04 16:20:09,591 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 16:20:09,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:09,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:09,593 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:09,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 16:20:09,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:20:09,604 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:20:09,604 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:20:09,604 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_1) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_1 + 11 Supporting invariants [] [2025-03-04 16:20:09,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-04 16:20:09,624 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 16:20:09,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 16:20:09,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 16:20:09,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2025-03-04 16:20:09,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:09,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:20:09,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:20:09,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:09,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:09,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 16:20:09,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:09,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:09,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:09,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:09,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:09,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 16:20:09,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:09,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 16:20:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:20:09,784 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2025-03-04 16:20:09,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34 Second operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:20:09,912 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34. Second operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 223 transitions. Complement of second has 20 states. [2025-03-04 16:20:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:20:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2025-03-04 16:20:09,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-04 16:20:09,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:09,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-04 16:20:09,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:09,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2025-03-04 16:20:09,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:09,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 223 transitions. [2025-03-04 16:20:09,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-03-04 16:20:09,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 162 states and 200 transitions. [2025-03-04 16:20:09,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-04 16:20:09,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-04 16:20:09,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 200 transitions. [2025-03-04 16:20:09,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:20:09,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2025-03-04 16:20:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 200 transitions. [2025-03-04 16:20:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 16:20:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.118279569892473) internal successors, (104), 104 states have internal predecessors, (104), 31 states have call successors, (31), 20 states have call predecessors, (31), 38 states have return successors, (65), 37 states have call predecessors, (65), 23 states have call successors, (65) [2025-03-04 16:20:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2025-03-04 16:20:09,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2025-03-04 16:20:09,924 INFO L432 stractBuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2025-03-04 16:20:09,924 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:20:09,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions. [2025-03-04 16:20:09,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-03-04 16:20:09,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:09,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:09,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:09,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:20:09,926 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#3(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#2(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#3(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);"< "~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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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);"< [2025-03-04 16:20:09,926 INFO L754 eck$LassoCheckResult]: Loop: "~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);"< [2025-03-04 16:20:09,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2105313028, now seen corresponding path program 2 times [2025-03-04 16:20:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746893548] [2025-03-04 16:20:09,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:09,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 16:20:09,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 16:20:09,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:20:09,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:09,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:09,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 16:20:09,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 16:20:09,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:09,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:09,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:09,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:09,960 INFO L85 PathProgramCache]: Analyzing trace with hash 32741, now seen corresponding path program 2 times [2025-03-04 16:20:09,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:09,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757485425] [2025-03-04 16:20:09,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:09,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:09,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:09,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:09,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:20:09,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:09,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:09,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:09,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:09,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:09,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:09,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:09,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash 27009290, now seen corresponding path program 3 times [2025-03-04 16:20:09,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:09,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746368710] [2025-03-04 16:20:09,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:20:09,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:09,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 8 equivalence classes. [2025-03-04 16:20:09,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 16:20:09,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 16:20:09,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:09,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:09,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 16:20:09,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 16:20:10,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:10,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:10,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:11,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 16:20:12,435 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:20:12,435 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:20:12,435 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:20:12,435 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:20:12,435 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:20:12,435 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:12,435 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:20:12,435 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:20:12,435 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration11_Lasso [2025-03-04 16:20:12,435 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:20:12,435 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:20:12,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:12,962 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:20:12,963 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:20:12,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:12,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:12,965 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:12,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 16:20:12,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:12,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:12,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:12,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:12,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:12,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:12,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:12,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:12,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:12,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:12,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:12,985 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:12,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-04 16:20:12,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:12,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:12,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:12,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:12,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:12,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:12,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:12,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:12,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-04 16:20:13,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,004 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-04 16:20:13,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-04 16:20:13,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,023 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 16:20:13,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 16:20:13,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,043 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 16:20:13,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:13,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,061 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 16:20:13,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-04 16:20:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,080 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-04 16:20:13,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-04 16:20:13,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,100 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-04 16:20:13,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-04 16:20:13,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,118 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-04 16:20:13,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,137 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-04 16:20:13,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 16:20:13,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,157 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-04 16:20:13,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-04 16:20:13,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,176 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-04 16:20:13,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-04 16:20:13,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,195 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-04 16:20:13,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:13,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:13,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-04 16:20:13,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,215 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-04 16:20:13,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:13,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:13,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:13,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,237 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-04 16:20:13,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-04 16:20:13,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,255 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-04 16:20:13,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-04 16:20:13,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,275 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-04 16:20:13,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:13,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,295 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-04 16:20:13,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:13,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,314 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-04 16:20:13,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-04 16:20:13,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,333 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-04 16:20:13,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-04 16:20:13,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,352 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-04 16:20:13,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-04 16:20:13,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,370 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-04 16:20:13,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:13,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,389 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-04 16:20:13,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:13,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:13,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:13,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:13,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-04 16:20:13,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,408 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-04 16:20:13,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:13,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:13,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:13,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:13,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:13,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:13,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:13,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:20:13,439 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 16:20:13,439 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 16:20:13,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:13,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:13,441 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:13,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-04 16:20:13,442 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:20:13,452 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:20:13,452 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:20:13,452 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_2) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_2 + 11 Supporting invariants [] [2025-03-04 16:20:13,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-04 16:20:13,467 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 16:20:13,468 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 16:20:13,468 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 16:20:13,468 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2025-03-04 16:20:13,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:13,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 16:20:13,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 16:20:13,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:13,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:13,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 16:20:13,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:13,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:13,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:13,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:13,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:13,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 16:20:13,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:13,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 16:20:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:20:13,853 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 16:20:13,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:20:13,914 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 16 states. [2025-03-04 16:20:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:20:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-04 16:20:13,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2025-03-04 16:20:13,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:13,918 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:20:13,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:13,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 16:20:13,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-04 16:20:14,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 16:20:14,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:14,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:14,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 16:20:14,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:14,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:14,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:14,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:14,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:14,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 16:20:14,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:14,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 16:20:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:20:14,314 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 16:20:14,314 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:20:14,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 16 states. [2025-03-04 16:20:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:20:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-04 16:20:14,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2025-03-04 16:20:14,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:14,384 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:20:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:14,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 16:20:14,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 16:20:14,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:14,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:14,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 16:20:14,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:14,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:14,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:14,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:14,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:14,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 16:20:14,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:14,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 16:20:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:20:14,716 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 16:20:14,717 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:20:14,787 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 223 states and 275 transitions. Complement of second has 17 states. [2025-03-04 16:20:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:20:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2025-03-04 16:20:14,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 3 letters. [2025-03-04 16:20:14,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:14,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 51 letters. Loop has 3 letters. [2025-03-04 16:20:14,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:14,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 6 letters. [2025-03-04 16:20:14,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:14,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 275 transitions. [2025-03-04 16:20:14,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:20:14,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 129 states and 159 transitions. [2025-03-04 16:20:14,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-04 16:20:14,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 16:20:14,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 159 transitions. [2025-03-04 16:20:14,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:20:14,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 159 transitions. [2025-03-04 16:20:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 159 transitions. [2025-03-04 16:20:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2025-03-04 16:20:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 68 states have (on average 1.088235294117647) internal successors, (74), 74 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 29 states have return successors, (46), 30 states have call predecessors, (46), 17 states have call successors, (46) [2025-03-04 16:20:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2025-03-04 16:20:14,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 141 transitions. [2025-03-04 16:20:14,802 INFO L432 stractBuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2025-03-04 16:20:14,802 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:20:14,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2025-03-04 16:20:14,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:20:14,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:14,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:14,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:14,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:14,804 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#3(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#2(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#3(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);"< "~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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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#2(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(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);"< "~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#3(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< [2025-03-04 16:20:14,805 INFO L754 eck$LassoCheckResult]: Loop: "~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#2(~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;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(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);"< [2025-03-04 16:20:14,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:14,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1550122481, now seen corresponding path program 2 times [2025-03-04 16:20:14,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:14,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608542741] [2025-03-04 16:20:14,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:14,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:14,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 261 statements into 2 equivalence classes. [2025-03-04 16:20:14,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 16:20:14,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:20:14,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:14,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:14,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 16:20:14,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 16:20:14,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:14,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:14,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:14,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1356371725, now seen corresponding path program 2 times [2025-03-04 16:20:14,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:14,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597992877] [2025-03-04 16:20:14,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:14,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:14,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 16:20:14,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:20:14,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:20:14,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:14,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:14,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 16:20:14,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:20:14,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:14,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:14,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 761371907, now seen corresponding path program 3 times [2025-03-04 16:20:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646682316] [2025-03-04 16:20:14,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:20:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:14,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 300 statements into 44 equivalence classes. [2025-03-04 16:20:15,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 16:20:15,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2025-03-04 16:20:15,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:15,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:15,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 16:20:15,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 16:20:15,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:15,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:15,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:25,570 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:20:25,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:20:25,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:20:25,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:20:25,570 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:20:25,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:25,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:20:25,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:20:25,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration12_Lasso [2025-03-04 16:20:25,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:20:25,570 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:20:25,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:25,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:20:26,246 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:20:26,246 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:20:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,248 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-04 16:20:26,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-04 16:20:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,270 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-04 16:20:26,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-04 16:20:26,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,290 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-04 16:20:26,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-04 16:20:26,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,313 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-04 16:20:26,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-04 16:20:26,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,335 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-04 16:20:26,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-04 16:20:26,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,355 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-04 16:20:26,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-04 16:20:26,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,375 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-04 16:20:26,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-04 16:20:26,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,395 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-04 16:20:26,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-04 16:20:26,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,414 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-04 16:20:26,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-04 16:20:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,434 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-04 16:20:26,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-03-04 16:20:26,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,454 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-04 16:20:26,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:20:26,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:20:26,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:20:26,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-04 16:20:26,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,473 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-04 16:20:26,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-04 16:20:26,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,496 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-04 16:20:26,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-03-04 16:20:26,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,517 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-04 16:20:26,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-03-04 16:20:26,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,540 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-04 16:20:26,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,554 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-04 16:20:26,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,562 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-04 16:20:26,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-04 16:20:26,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,583 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-04 16:20:26,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-03-04 16:20:26,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,606 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-04 16:20:26,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-04 16:20:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,628 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-04 16:20:26,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-04 16:20:26,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,654 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-04 16:20:26,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:20:26,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-04 16:20:26,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,677 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-04 16:20:26,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:20:26,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:20:26,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:20:26,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:20:26,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:20:26,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:20:26,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:20:26,698 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:20:26,710 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 16:20:26,710 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 16:20:26,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:20:26,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:26,712 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:20:26,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-04 16:20:26,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:20:26,723 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:20:26,723 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:20:26,723 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_2) = -2*v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_2 + 11 Supporting invariants [] [2025-03-04 16:20:26,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-03-04 16:20:26,752 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2025-03-04 16:20:26,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 16:20:26,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 16:20:26,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2025-03-04 16:20:26,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:26,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:26,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 16:20:27,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 16:20:27,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:27,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:27,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-04 16:20:27,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:28,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 16:20:28,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:20:28,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:28,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:28,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 16:20:28,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:28,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 16:20:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 16:20:28,838 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-04 16:20:28,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 16:20:28,951 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 176 transitions. Complement of second has 23 states. [2025-03-04 16:20:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 16:20:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2025-03-04 16:20:28,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2025-03-04 16:20:28,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:28,952 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:20:28,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:29,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 16:20:29,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 16:20:29,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:29,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:29,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-04 16:20:29,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:30,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 16:20:30,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:20:30,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:30,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 16:20:30,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:30,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 16:20:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 16:20:30,829 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-04 16:20:30,829 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 16:20:30,940 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 176 transitions. Complement of second has 23 states. [2025-03-04 16:20:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 16:20:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2025-03-04 16:20:30,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2025-03-04 16:20:30,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:30,941 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:20:30,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:31,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 16:20:31,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 16:20:31,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:31,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:31,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-04 16:20:31,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:32,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 16:20:32,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:20:32,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:32,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:32,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 16:20:32,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:32,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 16:20:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 16:20:32,767 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-04 16:20:32,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 16:20:32,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 225 states and 258 transitions. Complement of second has 23 states. [2025-03-04 16:20:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-04 16:20:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 16:20:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2025-03-04 16:20:32,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 261 letters. Loop has 39 letters. [2025-03-04 16:20:32,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:32,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 300 letters. Loop has 39 letters. [2025-03-04 16:20:32,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:32,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 261 letters. Loop has 78 letters. [2025-03-04 16:20:32,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:20:32,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 258 transitions. [2025-03-04 16:20:32,885 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:20:32,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 0 states and 0 transitions. [2025-03-04 16:20:32,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:20:32,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:20:32,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:20:32,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:20:32,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:20:32,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:20:32,886 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:20:32,886 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 16:20:32,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:20:32,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:20:32,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:20:32,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:20:32 BoogieIcfgContainer [2025-03-04 16:20:32,892 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:20:32,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:20:32,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:20:32,893 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:20:32,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:19:37" (3/4) ... [2025-03-04 16:20:32,895 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:20:32,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:20:32,896 INFO L158 Benchmark]: Toolchain (without parser) took 55785.26ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.3MB in the beginning and 89.0MB in the end (delta: 16.2MB). Peak memory consumption was 176.5MB. Max. memory is 16.1GB. [2025-03-04 16:20:32,896 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:20:32,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.41ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.2MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:20:32,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.16ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:20:32,896 INFO L158 Benchmark]: Boogie Preprocessor took 34.29ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:20:32,896 INFO L158 Benchmark]: IcfgBuilder took 294.26ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 77.4MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:20:32,896 INFO L158 Benchmark]: BuchiAutomizer took 55265.25ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 77.4MB in the beginning and 89.1MB in the end (delta: -11.7MB). Peak memory consumption was 151.3MB. Max. memory is 16.1GB. [2025-03-04 16:20:32,897 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 302.0MB. Free memory was 89.1MB in the beginning and 89.0MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:20:32,897 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.32ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.41ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.2MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.16ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.29ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 294.26ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 77.4MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 55265.25ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 77.4MB in the beginning and 89.1MB in the end (delta: -11.7MB). Peak memory consumption was 151.3MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 302.0MB. Free memory was 89.1MB in the beginning and 89.0MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 10 locations. One deterministic module has affine ranking function null and consists of 11 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 8 locations. 7 modules have a trivial ranking function, the largest among these consists of 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 55.2s and 13 iterations. TraceHistogramMax:42. Analysis of lassos took 42.9s. Construction of modules took 1.1s. Büchi inclusion checks took 11.0s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4401/4401 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 868 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1711 IncrementalHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 261 mSDtfsCounter, 1711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI7 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital271 mio100 ax100 hnf100 lsp94 ukn66 mio100 lsp21 div100 bol100 ite100 ukn100 eq215 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:20:32,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 16:20:33,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 16:20:33,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:33,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:33,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 16:20:33,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE