./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 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/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -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 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:20:13,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:20:13,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:20:13,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:20:13,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:20:13,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:20:13,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:20:13,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:20:13,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:20:13,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:20:13,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:20:13,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:20:13,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:20:13,990 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:20:13,991 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:20:13,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:20:13,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:20:13,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:20:13,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:20:13,992 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:20:13,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:20:13,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:20:13,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:20:13,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:20:13,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:20:13,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:20:13,992 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:20:13,992 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 -> 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 [2025-03-17 20:20:14,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:20:14,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:20:14,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:20:14,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:20:14,256 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:20:14,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-03-17 20:20:15,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0682d3735/874534f0f376489ab3ca6006b45d92a2/FLAG54598271c [2025-03-17 20:20:15,587 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:20:15,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-03-17 20:20:15,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0682d3735/874534f0f376489ab3ca6006b45d92a2/FLAG54598271c [2025-03-17 20:20:15,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0682d3735/874534f0f376489ab3ca6006b45d92a2 [2025-03-17 20:20:15,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:20:15,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:20:15,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:20:15,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:20:15,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:20:15,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:20:15" (1/1) ... [2025-03-17 20:20:15,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215d5655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:15, skipping insertion in model container [2025-03-17 20:20:15,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:20:15" (1/1) ... [2025-03-17 20:20:15,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:20:16,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:20:16,089 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:20:16,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:20:16,130 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:20:16,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16 WrapperNode [2025-03-17 20:20:16,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:20:16,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:20:16,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:20:16,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:20:16,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,153 INFO L138 Inliner]: procedures = 42, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 145 [2025-03-17 20:20:16,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:20:16,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:20:16,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:20:16,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:20:16,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,173 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-17 20:20:16,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:20:16,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:20:16,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:20:16,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:20:16,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:16,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:16,212 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-17 20:20:16,214 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-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:20:16,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:20:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:20:16,289 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:20:16,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:20:16,455 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-03-17 20:20:16,455 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset; [2025-03-17 20:20:16,455 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset);havoc parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset; [2025-03-17 20:20:16,468 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-17 20:20:16,468 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:20:16,476 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:20:16,477 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:20:16,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:20:16 BoogieIcfgContainer [2025-03-17 20:20:16,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:20:16,478 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:20:16,478 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:20:16,482 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:20:16,483 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:20:16,484 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:20:15" (1/3) ... [2025-03-17 20:20:16,485 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@666e1d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:20:16, skipping insertion in model container [2025-03-17 20:20:16,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:20:16,485 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16" (2/3) ... [2025-03-17 20:20:16,485 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@666e1d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:20:16, skipping insertion in model container [2025-03-17 20:20:16,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:20:16,486 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:20:16" (3/3) ... [2025-03-17 20:20:16,486 INFO L363 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-03-17 20:20:16,516 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:20:16,517 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:20:16,517 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:20:16,517 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:20:16,517 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:20:16,517 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:20:16,517 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:20:16,517 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:20:16,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.59375) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:16,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2025-03-17 20:20:16,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:16,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:16,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:20:16,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:20:16,537 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:20:16,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.59375) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:16,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2025-03-17 20:20:16,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:16,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:16,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:20:16,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:20:16,543 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" [2025-03-17 20:20:16,544 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" [2025-03-17 20:20:16,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash 97, now seen corresponding path program 1 times [2025-03-17 20:20:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:16,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388948209] [2025-03-17 20:20:16,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:16,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:16,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:16,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:16,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:16,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:16,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:16,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:16,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:16,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:16,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:16,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash 96, now seen corresponding path program 1 times [2025-03-17 20:20:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720464209] [2025-03-17 20:20:16,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:16,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:16,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:16,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:16,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:16,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:16,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:16,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:16,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:16,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:16,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:16,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:16,651 INFO L85 PathProgramCache]: Analyzing trace with hash 3072, now seen corresponding path program 1 times [2025-03-17 20:20:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:16,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778443973] [2025-03-17 20:20:16,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:16,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:16,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:16,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:16,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:16,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:16,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:16,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:16,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:16,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:16,918 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:16,919 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:16,919 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:16,919 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:16,919 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:16,921 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:16,921 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:16,921 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:16,921 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2025-03-17 20:20:16,921 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:16,921 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:16,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,219 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:17,221 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:17,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,224 INFO L229 MonitoredProcess]: Starting monitored process 2 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-17 20:20:17,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:20:17,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-17 20:20:17,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:17,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:17,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:17,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:17,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:17,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:17,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:17,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 20:20:17,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,269 INFO L229 MonitoredProcess]: Starting monitored process 3 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-17 20:20:17,271 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-17 20:20:17,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:20:17,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:17,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:17,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:17,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:17,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:17,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:17,286 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:17,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 20:20:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,294 INFO L229 MonitoredProcess]: Starting monitored process 4 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-17 20:20:17,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:20:17,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-17 20:20:17,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:17,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:17,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:17,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:17,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:17,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:17,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:17,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:17,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,326 INFO L229 MonitoredProcess]: Starting monitored process 5 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-17 20:20:17,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:20:17,329 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-17 20:20:17,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:17,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:17,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:17,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:17,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:17,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:17,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:17,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:17,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,351 INFO L229 MonitoredProcess]: Starting monitored process 6 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-17 20:20:17,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:20:17,354 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-17 20:20:17,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:17,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:17,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:17,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:17,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:17,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:17,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:17,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:17,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,382 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-17 20:20:17,384 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-17 20:20:17,384 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-17 20:20:17,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:17,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:17,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:17,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:17,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:17,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:17,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:17,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:17,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:17,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,405 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-17 20:20:17,407 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-17 20:20:17,408 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-17 20:20:17,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:17,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:17,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:17,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:17,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:17,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:17,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:17,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:17,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,433 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-17 20:20:17,434 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-17 20:20:17,435 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-17 20:20:17,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:17,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:17,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:17,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:17,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:17,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:17,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:17,480 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-17 20:20:17,482 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 20:20:17,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,485 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-17 20:20:17,487 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-17 20:20:17,488 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:17,500 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:17,501 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:17,501 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 15*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-03-17 20:20:17,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:17,519 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:20:17,525 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:20:17,525 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:20:17,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:17,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:17,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:17,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:17,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:17,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:17,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:17,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:17,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:17,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:17,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:17,567 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-17 20:20:17,585 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:20:17,586 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.59375) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:17,608 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.59375) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 53 transitions. Complement of second has 3 states. [2025-03-17 20:20:17,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 20:20:17,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2025-03-17 20:20:17,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:17,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 20:20:17,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:17,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 20:20:17,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:17,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2025-03-17 20:20:17,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:20:17,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 44 transitions. [2025-03-17 20:20:17,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-17 20:20:17,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-17 20:20:17,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 44 transitions. [2025-03-17 20:20:17,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:17,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 44 transitions. [2025-03-17 20:20:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 44 transitions. [2025-03-17 20:20:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-17 20:20:17,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2025-03-17 20:20:17,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 44 transitions. [2025-03-17 20:20:17,642 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2025-03-17 20:20:17,642 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:20:17,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2025-03-17 20:20:17,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:20:17,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:17,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:17,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:20:17,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:20:17,644 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" [2025-03-17 20:20:17,644 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" [2025-03-17 20:20:17,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash 95264, now seen corresponding path program 1 times [2025-03-17 20:20:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:17,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083197005] [2025-03-17 20:20:17,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:17,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:17,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:17,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:17,729 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-17 20:20:17,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:17,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083197005] [2025-03-17 20:20:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083197005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:17,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:17,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:20:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766651741] [2025-03-17 20:20:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:17,732 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:17,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2737214, now seen corresponding path program 1 times [2025-03-17 20:20:17,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:17,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576451777] [2025-03-17 20:20:17,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:17,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:17,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:17,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:17,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:17,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:17,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:17,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:20:17,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:20:17,796 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:17,807 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-03-17 20:20:17,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2025-03-17 20:20:17,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 20:20:17,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 37 transitions. [2025-03-17 20:20:17,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:17,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 20:20:17,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2025-03-17 20:20:17,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:17,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-17 20:20:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2025-03-17 20:20:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 20:20:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-03-17 20:20:17,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-17 20:20:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:20:17,810 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-17 20:20:17,810 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:20:17,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2025-03-17 20:20:17,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 20:20:17,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:17,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:17,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:20:17,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:20:17,811 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" [2025-03-17 20:20:17,811 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" [2025-03-17 20:20:17,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2954239, now seen corresponding path program 1 times [2025-03-17 20:20:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016176409] [2025-03-17 20:20:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:17,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:17,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016176409] [2025-03-17 20:20:17,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016176409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230440775] [2025-03-17 20:20:17,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:17,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 20:20:17,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:17,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:17,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 20:20:17,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:17,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:17,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230440775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:17,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:17,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 20:20:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015014209] [2025-03-17 20:20:17,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:17,946 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:17,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2737214, now seen corresponding path program 2 times [2025-03-17 20:20:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:17,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849579885] [2025-03-17 20:20:17,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:17,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:17,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:17,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:17,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:17,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:17,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:17,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:17,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:18,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:20:18,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:18,014 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:18,034 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-17 20:20:18,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2025-03-17 20:20:18,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 20:20:18,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 40 transitions. [2025-03-17 20:20:18,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:18,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 20:20:18,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2025-03-17 20:20:18,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:18,035 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-17 20:20:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2025-03-17 20:20:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 20:20:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2025-03-17 20:20:18,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-17 20:20:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:20:18,040 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-17 20:20:18,040 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:20:18,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2025-03-17 20:20:18,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 20:20:18,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:18,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:18,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-03-17 20:20:18,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:20:18,041 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" [2025-03-17 20:20:18,041 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" [2025-03-17 20:20:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2111435744, now seen corresponding path program 2 times [2025-03-17 20:20:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939415887] [2025-03-17 20:20:18,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-17 20:20:18,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:20:18,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:18,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:18,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:18,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939415887] [2025-03-17 20:20:18,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939415887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:18,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522353159] [2025-03-17 20:20:18,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:18,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:18,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,158 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 20:20:18,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-17 20:20:18,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:20:18,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:18,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:18,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:18,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:18,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:18,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522353159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:18,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 20:20:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680654383] [2025-03-17 20:20:18,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:18,298 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:18,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2737214, now seen corresponding path program 3 times [2025-03-17 20:20:18,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414974534] [2025-03-17 20:20:18,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:18,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:18,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:18,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:18,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:18,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:18,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:18,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:18,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 20:20:18,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 20:20:18,360 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:18,377 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-03-17 20:20:18,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2025-03-17 20:20:18,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 20:20:18,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2025-03-17 20:20:18,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:18,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 20:20:18,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2025-03-17 20:20:18,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:18,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-03-17 20:20:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2025-03-17 20:20:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 20:20:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2025-03-17 20:20:18,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-03-17 20:20:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 20:20:18,381 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-03-17 20:20:18,381 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:20:18,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2025-03-17 20:20:18,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 20:20:18,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:18,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:18,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1] [2025-03-17 20:20:18,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:20:18,382 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" [2025-03-17 20:20:18,382 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" [2025-03-17 20:20:18,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1475122080, now seen corresponding path program 3 times [2025-03-17 20:20:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412896980] [2025-03-17 20:20:18,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:18,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 5 equivalence classes. [2025-03-17 20:20:18,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:20:18,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:20:18,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:18,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:20:18,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:20:18,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:18,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2737214, now seen corresponding path program 4 times [2025-03-17 20:20:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411794849] [2025-03-17 20:20:18,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:20:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,434 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-03-17 20:20:18,435 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:18,436 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:20:18,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:18,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:18,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:18,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:18,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1571458979, now seen corresponding path program 1 times [2025-03-17 20:20:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660171879] [2025-03-17 20:20:18,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:20:18,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:20:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:18,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:20:18,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:20:18,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:22,219 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:22,219 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:22,219 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:22,219 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:22,219 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:22,219 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,219 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:22,219 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:22,219 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration5_Lasso [2025-03-17 20:20:22,219 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:22,219 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:22,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:22,798 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:22,798 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,804 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-17 20:20:22,805 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-17 20:20:22,805 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-17 20:20:22,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:22,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:22,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:22,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:22,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:22,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:22,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:22,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:22,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 20:20:22,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,825 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-17 20:20:22,826 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-17 20:20:22,826 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-17 20:20:22,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:22,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:22,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:22,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:22,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:22,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:22,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:22,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:22,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:20:22,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,845 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-17 20:20:22,846 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-17 20:20:22,847 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-17 20:20:22,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:22,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:22,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:22,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:22,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:22,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:22,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:22,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:22,863 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-17 20:20:22,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,865 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-17 20:20:22,867 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-17 20:20:22,868 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-17 20:20:22,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:22,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:22,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:22,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:22,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:22,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:22,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:22,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:22,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,894 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-17 20:20:22,895 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-17 20:20:22,897 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-17 20:20:22,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:22,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:22,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:22,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:22,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:22,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:22,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:22,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:22,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:22,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,917 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-17 20:20:22,918 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-17 20:20:22,923 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-17 20:20:22,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:22,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:22,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:22,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:22,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:22,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:22,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:22,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:22,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 20:20:22,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,942 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-17 20:20:22,943 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-17 20:20:22,944 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-17 20:20:22,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:22,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:22,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:22,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:22,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:22,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:22,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:22,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:22,960 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-17 20:20:22,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,963 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-17 20:20:22,964 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-17 20:20:22,965 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-17 20:20:22,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:22,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:22,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:22,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:22,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:22,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:22,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:22,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 20:20:22,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:22,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:22,990 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-17 20:20:22,991 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-17 20:20:22,993 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-17 20:20:23,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 20:20:23,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,016 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-17 20:20:23,017 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-17 20:20:23,017 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-17 20:20:23,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,037 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-17 20:20:23,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,039 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-17 20:20:23,039 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-17 20:20:23,040 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-17 20:20:23,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 20:20:23,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,059 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-17 20:20:23,060 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-17 20:20:23,062 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-17 20:20:23,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,081 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-17 20:20:23,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,083 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-17 20:20:23,085 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-17 20:20:23,086 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-17 20:20:23,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:23,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,105 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-17 20:20:23,106 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-17 20:20:23,107 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-17 20:20:23,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:23,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,133 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-17 20:20:23,134 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-17 20:20:23,134 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-17 20:20:23,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,154 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-17 20:20:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,157 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-17 20:20:23,158 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-17 20:20:23,159 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-17 20:20:23,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,175 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-17 20:20:23,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,177 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-17 20:20:23,177 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-17 20:20:23,178 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-17 20:20:23,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,197 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-17 20:20:23,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,198 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-17 20:20:23,199 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-17 20:20:23,200 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-17 20:20:23,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:23,239 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2025-03-17 20:20:23,239 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-17 20:20:23,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,241 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-17 20:20:23,242 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-17 20:20:23,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:23,253 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:23,253 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:23,253 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str#1.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1, ULTIMATE.start_parse_expression_list_~i~0#1) = -1*ULTIMATE.start_parse_expression_list_~str#1.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0#1 Supporting invariants [] [2025-03-17 20:20:23,259 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-17 20:20:23,281 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:20:23,282 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:20:23,282 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:20:23,282 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~str!offset [2025-03-17 20:20:23,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:23,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:20:23,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:20:23,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:23,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:23,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:23,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:23,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:23,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:23,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:20:23,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:23,357 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-17 20:20:23,357 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:23,358 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:23,393 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 78 transitions. Complement of second has 4 states. [2025-03-17 20:20:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-03-17 20:20:23,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 20:20:23,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:23,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 15 letters. Loop has 4 letters. [2025-03-17 20:20:23,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:23,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 11 letters. Loop has 8 letters. [2025-03-17 20:20:23,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:23,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2025-03-17 20:20:23,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:23,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 63 transitions. [2025-03-17 20:20:23,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-17 20:20:23,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-17 20:20:23,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2025-03-17 20:20:23,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:23,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-03-17 20:20:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2025-03-17 20:20:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-17 20:20:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-03-17 20:20:23,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-17 20:20:23,404 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-17 20:20:23,404 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:20:23,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2025-03-17 20:20:23,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:23,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:23,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:23,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1] [2025-03-17 20:20:23,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:23,405 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" [2025-03-17 20:20:23,405 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1;" [2025-03-17 20:20:23,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash 253113086, now seen corresponding path program 1 times [2025-03-17 20:20:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:23,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808199765] [2025-03-17 20:20:23,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:23,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:20:23,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:20:23,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:23,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:20:23,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:20:23,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:23,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:23,454 INFO L85 PathProgramCache]: Analyzing trace with hash 84341, now seen corresponding path program 1 times [2025-03-17 20:20:23,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366457474] [2025-03-17 20:20:23,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:23,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:23,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:23,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:23,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:23,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:23,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:23,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1470572200, now seen corresponding path program 1 times [2025-03-17 20:20:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832577446] [2025-03-17 20:20:23,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:23,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:20:23,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:20:23,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:23,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:20:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:23,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832577446] [2025-03-17 20:20:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832577446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:23,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:23,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:20:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831113902] [2025-03-17 20:20:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:23,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:20:23,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:23,784 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. cyclomatic complexity: 20 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:23,859 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2025-03-17 20:20:23,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 104 transitions. [2025-03-17 20:20:23,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-17 20:20:23,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 104 transitions. [2025-03-17 20:20:23,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:23,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 20:20:23,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 104 transitions. [2025-03-17 20:20:23,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:23,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 104 transitions. [2025-03-17 20:20:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 104 transitions. [2025-03-17 20:20:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2025-03-17 20:20:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 52 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-03-17 20:20:23,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-17 20:20:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:20:23,866 INFO L432 stractBuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-17 20:20:23,866 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:20:23,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2025-03-17 20:20:23,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:23,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:23,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:23,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:23,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:23,867 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" [2025-03-17 20:20:23,867 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1;" [2025-03-17 20:20:23,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:23,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1656411259, now seen corresponding path program 1 times [2025-03-17 20:20:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:23,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268800045] [2025-03-17 20:20:23,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:23,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:23,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:20:23,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:20:23,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:23,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:20:23,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:20:23,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:23,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 84341, now seen corresponding path program 2 times [2025-03-17 20:20:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068995129] [2025-03-17 20:20:23,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:23,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:23,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:23,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:23,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,903 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:23,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:23,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:23,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:23,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1268607675, now seen corresponding path program 1 times [2025-03-17 20:20:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:23,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813698388] [2025-03-17 20:20:23,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:23,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:23,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:20:23,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:20:23,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:23,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:20:23,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:20:23,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:23,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:23,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:27,796 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:27,796 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:27,796 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:27,796 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:27,796 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:27,796 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,796 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:27,796 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:27,796 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2025-03-17 20:20:27,797 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:27,797 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:27,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:27,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,349 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:28,349 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:28,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,351 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-17 20:20:28,352 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-17 20:20:28,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-17 20:20:28,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:28,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,372 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-17 20:20:28,373 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-17 20:20:28,374 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-17 20:20:28,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:20:28,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,392 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-17 20:20:28,393 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-17 20:20:28,394 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-17 20:20:28,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,410 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-17 20:20:28,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,412 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-17 20:20:28,413 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-17 20:20:28,414 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-17 20:20:28,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,430 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-17 20:20:28,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,432 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-17 20:20:28,433 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-17 20:20:28,434 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-17 20:20:28,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,450 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-17 20:20:28,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,452 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-17 20:20:28,459 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-17 20:20:28,460 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-17 20:20:28,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,476 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-17 20:20:28,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,479 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-17 20:20:28,479 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-17 20:20:28,480 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-17 20:20:28,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,497 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-17 20:20:28,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,499 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-17 20:20:28,500 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-17 20:20:28,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-17 20:20:28,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,524 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-17 20:20:28,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,526 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-17 20:20:28,527 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-17 20:20:28,529 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-17 20:20:28,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:28,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,548 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-17 20:20:28,548 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-17 20:20:28,549 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-17 20:20:28,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,566 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-17 20:20:28,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,568 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-17 20:20:28,569 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-17 20:20:28,570 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-17 20:20:28,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:28,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,588 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-17 20:20:28,588 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-17 20:20:28,589 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-17 20:20:28,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 20:20:28,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,607 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-17 20:20:28,609 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-17 20:20:28,609 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-17 20:20:28,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 20:20:28,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,628 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-17 20:20:28,628 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-17 20:20:28,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-17 20:20:28,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,646 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-17 20:20:28,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,647 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-17 20:20:28,648 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-17 20:20:28,649 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-17 20:20:28,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,667 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-17 20:20:28,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,669 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-17 20:20:28,671 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-17 20:20:28,671 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-17 20:20:28,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,690 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-17 20:20:28,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,692 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-17 20:20:28,693 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-17 20:20:28,694 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-17 20:20:28,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 20:20:28,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,712 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-17 20:20:28,713 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-17 20:20:28,714 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-17 20:20:28,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,732 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-17 20:20:28,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,734 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-17 20:20:28,735 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-17 20:20:28,735 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-17 20:20:28,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,754 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-17 20:20:28,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,756 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-17 20:20:28,757 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-17 20:20:28,758 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-17 20:20:28,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,777 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-17 20:20:28,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,780 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-17 20:20:28,781 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-17 20:20:28,782 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-17 20:20:28,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,798 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-17 20:20:28,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,800 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-17 20:20:28,800 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-17 20:20:28,801 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-17 20:20:28,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 20:20:28,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,820 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-17 20:20:28,821 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-17 20:20:28,822 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-17 20:20:28,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 20:20:28,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,840 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-17 20:20:28,841 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-17 20:20:28,843 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-17 20:20:28,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,861 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-17 20:20:28,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,863 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-17 20:20:28,864 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-17 20:20:28,865 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-17 20:20:28,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,886 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-17 20:20:28,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,888 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-17 20:20:28,889 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-17 20:20:28,889 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-17 20:20:28,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,908 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-17 20:20:28,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,910 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-17 20:20:28,910 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-17 20:20:28,911 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-17 20:20:28,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,928 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-17 20:20:28,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,930 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-17 20:20:28,931 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-17 20:20:28,932 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-17 20:20:28,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,951 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:28,962 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:20:28,962 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 20:20:28,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,964 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-17 20:20:28,965 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-17 20:20:28,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:28,977 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:28,977 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:28,977 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str#1.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2, ULTIMATE.start_parse_expression_list_~start~0#1) = -1*ULTIMATE.start_parse_expression_list_~str#1.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0#1 Supporting invariants [] [2025-03-17 20:20:28,983 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-17 20:20:29,004 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:20:29,006 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:20:29,006 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:20:29,006 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~str!offset [2025-03-17 20:20:29,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:20:29,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:20:29,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:29,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:29,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:29,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:29,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 20:20:29,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:29,082 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-17 20:20:29,083 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:29,083 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 71 transitions. cyclomatic complexity: 22 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 71 transitions. cyclomatic complexity: 22. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 159 states and 220 transitions. Complement of second has 7 states. [2025-03-17 20:20:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-03-17 20:20:29,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-17 20:20:29,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:29,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 20 letters. Loop has 3 letters. [2025-03-17 20:20:29,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:29,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 17 letters. Loop has 6 letters. [2025-03-17 20:20:29,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:29,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 220 transitions. [2025-03-17 20:20:29,139 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-17 20:20:29,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 121 states and 166 transitions. [2025-03-17 20:20:29,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-03-17 20:20:29,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-17 20:20:29,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2025-03-17 20:20:29,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:29,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 166 transitions. [2025-03-17 20:20:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2025-03-17 20:20:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 78. [2025-03-17 20:20:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2025-03-17 20:20:29,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 109 transitions. [2025-03-17 20:20:29,149 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 109 transitions. [2025-03-17 20:20:29,150 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:20:29,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 109 transitions. [2025-03-17 20:20:29,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:29,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:29,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:29,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:29,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:29,151 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:29,153 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume !parse_expression_list_#t~short14#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:29,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1149973192, now seen corresponding path program 1 times [2025-03-17 20:20:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261045000] [2025-03-17 20:20:29,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 20:20:29,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:20:29,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,342 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-17 20:20:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:29,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:29,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261045000] [2025-03-17 20:20:29,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261045000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:29,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:29,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 20:20:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443954106] [2025-03-17 20:20:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:29,405 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:29,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash 72453, now seen corresponding path program 1 times [2025-03-17 20:20:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389776910] [2025-03-17 20:20:29,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:29,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:29,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,411 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-17 20:20:29,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:29,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389776910] [2025-03-17 20:20:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389776910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:20:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984591442] [2025-03-17 20:20:29,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:29,412 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:20:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:29,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:20:29,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:20:29,413 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. cyclomatic complexity: 38 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:29,420 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2025-03-17 20:20:29,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 110 transitions. [2025-03-17 20:20:29,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:29,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 79 states and 109 transitions. [2025-03-17 20:20:29,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:29,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 20:20:29,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 109 transitions. [2025-03-17 20:20:29,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:29,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 109 transitions. [2025-03-17 20:20:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 109 transitions. [2025-03-17 20:20:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 20:20:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.379746835443038) internal successors, (109), 78 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2025-03-17 20:20:29,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 109 transitions. [2025-03-17 20:20:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:20:29,427 INFO L432 stractBuchiCegarLoop]: Abstraction has 79 states and 109 transitions. [2025-03-17 20:20:29,427 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:20:29,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 109 transitions. [2025-03-17 20:20:29,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:29,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:29,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:29,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:29,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:29,428 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:29,428 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:29,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1149973192, now seen corresponding path program 2 times [2025-03-17 20:20:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985771001] [2025-03-17 20:20:29,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:29,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 20:20:29,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 19 statements. [2025-03-17 20:20:29,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:29,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:29,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:29,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985771001] [2025-03-17 20:20:29,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985771001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:29,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:29,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:20:29,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240034890] [2025-03-17 20:20:29,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:29,610 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:29,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash 69600679, now seen corresponding path program 1 times [2025-03-17 20:20:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262569020] [2025-03-17 20:20:29,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:29,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:29,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:29,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:29,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:29,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:29,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:20:29,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:29,685 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. cyclomatic complexity: 37 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:29,774 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2025-03-17 20:20:29,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 144 transitions. [2025-03-17 20:20:29,775 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-17 20:20:29,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 102 states and 136 transitions. [2025-03-17 20:20:29,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-17 20:20:29,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-17 20:20:29,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 136 transitions. [2025-03-17 20:20:29,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:29,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 136 transitions. [2025-03-17 20:20:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 136 transitions. [2025-03-17 20:20:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2025-03-17 20:20:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 74 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-03-17 20:20:29,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-03-17 20:20:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:20:29,779 INFO L432 stractBuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-03-17 20:20:29,779 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:20:29,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 103 transitions. [2025-03-17 20:20:29,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:29,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:29,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:29,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:29,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:29,780 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:29,780 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:29,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1149973161, now seen corresponding path program 1 times [2025-03-17 20:20:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937785804] [2025-03-17 20:20:29,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 20:20:29,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:20:29,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:29,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 20:20:29,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:20:29,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:29,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 69600679, now seen corresponding path program 2 times [2025-03-17 20:20:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353595653] [2025-03-17 20:20:29,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:29,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:29,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:29,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:29,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:29,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:29,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:29,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1251336687, now seen corresponding path program 1 times [2025-03-17 20:20:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521521392] [2025-03-17 20:20:29,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:20:29,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:20:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:29,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:29,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521521392] [2025-03-17 20:20:29,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521521392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:29,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:29,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:20:29,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192045682] [2025-03-17 20:20:29,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:29,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:20:29,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:20:29,965 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. cyclomatic complexity: 35 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:30,011 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2025-03-17 20:20:30,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 131 transitions. [2025-03-17 20:20:30,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:30,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 94 states and 123 transitions. [2025-03-17 20:20:30,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:20:30,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-17 20:20:30,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 123 transitions. [2025-03-17 20:20:30,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:30,013 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 123 transitions. [2025-03-17 20:20:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 123 transitions. [2025-03-17 20:20:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2025-03-17 20:20:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 78 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2025-03-17 20:20:30,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 106 transitions. [2025-03-17 20:20:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:20:30,015 INFO L432 stractBuchiCegarLoop]: Abstraction has 79 states and 106 transitions. [2025-03-17 20:20:30,015 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:20:30,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 106 transitions. [2025-03-17 20:20:30,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:30,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:30,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:30,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:30,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:30,016 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume parse_expression_list_#t~short7#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:30,016 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:30,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1674949750, now seen corresponding path program 1 times [2025-03-17 20:20:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583217391] [2025-03-17 20:20:30,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:20:30,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:20:30,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-17 20:20:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583217391] [2025-03-17 20:20:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583217391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:30,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:30,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:20:30,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925608398] [2025-03-17 20:20:30,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:30,038 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:30,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 69600679, now seen corresponding path program 3 times [2025-03-17 20:20:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663324648] [2025-03-17 20:20:30,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:30,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:30,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:20:30,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:20:30,108 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:30,115 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2025-03-17 20:20:30,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2025-03-17 20:20:30,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:20:30,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 83 states and 108 transitions. [2025-03-17 20:20:30,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-17 20:20:30,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 20:20:30,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 108 transitions. [2025-03-17 20:20:30,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:30,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-03-17 20:20:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 108 transitions. [2025-03-17 20:20:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-17 20:20:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 82 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2025-03-17 20:20:30,118 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-03-17 20:20:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:20:30,118 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-03-17 20:20:30,118 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:20:30,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 108 transitions. [2025-03-17 20:20:30,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:20:30,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:30,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:30,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:30,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:30,119 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:30,119 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:30,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1674026229, now seen corresponding path program 1 times [2025-03-17 20:20:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546673382] [2025-03-17 20:20:30,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:20:30,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:20:30,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:20:30,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:20:30,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash 69600679, now seen corresponding path program 4 times [2025-03-17 20:20:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200313177] [2025-03-17 20:20:30,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:20:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:20:30,144 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,144 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:20:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1189191373, now seen corresponding path program 1 times [2025-03-17 20:20:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922268458] [2025-03-17 20:20:30,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:20:30,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:20:30,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:30,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922268458] [2025-03-17 20:20:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922268458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784738481] [2025-03-17 20:20:30,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:30,226 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:30,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-03-17 20:20:30,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:20:30,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:20:30,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:30,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:30,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:30,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:30,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784738481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:30,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:30,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-17 20:20:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288812706] [2025-03-17 20:20:30,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:30,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:20:30,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:30,432 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:30,511 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2025-03-17 20:20:30,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 199 transitions. [2025-03-17 20:20:30,511 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-17 20:20:30,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 138 states and 177 transitions. [2025-03-17 20:20:30,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-17 20:20:30,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 20:20:30,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 177 transitions. [2025-03-17 20:20:30,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:30,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 177 transitions. [2025-03-17 20:20:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 177 transitions. [2025-03-17 20:20:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2025-03-17 20:20:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2025-03-17 20:20:30,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 122 states and 159 transitions. [2025-03-17 20:20:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 20:20:30,515 INFO L432 stractBuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2025-03-17 20:20:30,515 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:20:30,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2025-03-17 20:20:30,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 20:20:30,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:30,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:30,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:30,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:30,516 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:30,517 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:30,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,518 INFO L85 PathProgramCache]: Analyzing trace with hash 42092082, now seen corresponding path program 2 times [2025-03-17 20:20:30,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670280597] [2025-03-17 20:20:30,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:30,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 20:20:30,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:30,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:30,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:20:30,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:30,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,545 INFO L85 PathProgramCache]: Analyzing trace with hash 69600679, now seen corresponding path program 5 times [2025-03-17 20:20:30,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995869079] [2025-03-17 20:20:30,545 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:20:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,548 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:30,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash 163378710, now seen corresponding path program 2 times [2025-03-17 20:20:30,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749073771] [2025-03-17 20:20:30,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 20:20:30,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 20:20:30,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:30,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 20:20:30,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 20:20:30,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:37,280 WARN L286 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 303 DAG size of output: 212 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:20:37,484 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:37,485 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:37,485 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:37,485 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:37,485 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:37,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:37,485 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:37,485 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:37,485 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration13_Lasso [2025-03-17 20:20:37,485 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:37,485 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:37,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:37,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:38,114 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:38,115 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:38,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,117 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-17 20:20:38,119 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-17 20:20:38,119 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-17 20:20:38,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:38,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,165 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-17 20:20:38,166 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-17 20:20:38,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:38,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,184 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-17 20:20:38,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,186 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-17 20:20:38,187 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-17 20:20:38,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-17 20:20:38,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,205 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-17 20:20:38,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,206 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-17 20:20:38,208 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-17 20:20:38,208 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-17 20:20:38,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,226 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-17 20:20:38,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,228 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-17 20:20:38,230 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-17 20:20:38,232 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-17 20:20:38,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,250 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-17 20:20:38,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,252 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-17 20:20:38,252 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-17 20:20:38,254 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-17 20:20:38,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,270 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-17 20:20:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,272 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-17 20:20:38,273 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-17 20:20:38,274 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-17 20:20:38,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:38,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,293 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-17 20:20:38,294 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-17 20:20:38,295 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-17 20:20:38,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,313 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-17 20:20:38,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,315 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-17 20:20:38,316 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-17 20:20:38,317 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-17 20:20:38,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:38,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:38,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,335 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-17 20:20:38,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,337 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-17 20:20:38,338 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-17 20:20:38,339 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-17 20:20:38,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:38,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:38,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,358 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-17 20:20:38,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,360 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-17 20:20:38,361 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-17 20:20:38,361 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-17 20:20:38,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:38,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:38,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:38,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,383 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-17 20:20:38,384 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-17 20:20:38,385 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-17 20:20:38,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:38,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,403 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-17 20:20:38,404 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-17 20:20:38,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-17 20:20:38,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:38,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:38,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:38,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 20:20:38,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,423 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-17 20:20:38,424 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-17 20:20:38,425 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-17 20:20:38,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:38,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:38,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,444 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-17 20:20:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,446 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-17 20:20:38,448 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-17 20:20:38,449 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-17 20:20:38,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:38,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:38,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:38,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,470 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-17 20:20:38,471 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-17 20:20:38,472 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-17 20:20:38,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:38,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:38,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:38,492 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-17 20:20:38,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,494 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-17 20:20:38,494 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-17 20:20:38,495 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-17 20:20:38,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:38,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:38,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:38,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:38,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:38,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:38,514 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:38,524 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:20:38,524 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-17 20:20:38,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:38,526 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-17 20:20:38,527 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-17 20:20:38,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:38,538 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:38,538 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:38,538 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0#1) = 1*ULTIMATE.start_parse_expression_list_~j~0#1 Supporting invariants [] [2025-03-17 20:20:38,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-17 20:20:38,565 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:20:38,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:38,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:20:38,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:38,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:38,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:38,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:38,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:38,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:38,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:38,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:38,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:38,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:38,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:38,669 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-17 20:20:38,669 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:20:38,670 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 159 transitions. cyclomatic complexity: 47 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:38,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 159 transitions. cyclomatic complexity: 47. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 192 states and 247 transitions. Complement of second has 9 states. [2025-03-17 20:20:38,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-03-17 20:20:38,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 27 letters. Loop has 5 letters. [2025-03-17 20:20:38,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:38,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 32 letters. Loop has 5 letters. [2025-03-17 20:20:38,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:38,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 27 letters. Loop has 10 letters. [2025-03-17 20:20:38,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:38,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 247 transitions. [2025-03-17 20:20:38,728 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 20:20:38,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 145 states and 186 transitions. [2025-03-17 20:20:38,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 20:20:38,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 20:20:38,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 186 transitions. [2025-03-17 20:20:38,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:38,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 186 transitions. [2025-03-17 20:20:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 186 transitions. [2025-03-17 20:20:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2025-03-17 20:20:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 126 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 166 transitions. [2025-03-17 20:20:38,732 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 166 transitions. [2025-03-17 20:20:38,732 INFO L432 stractBuchiCegarLoop]: Abstraction has 127 states and 166 transitions. [2025-03-17 20:20:38,732 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 20:20:38,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 166 transitions. [2025-03-17 20:20:38,733 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 20:20:38,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:38,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:38,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:38,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:38,735 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume !parse_expression_list_#t~short14#1;" "assume !parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;" "parse_expression_list_#t~short17#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short17#1;call parse_expression_list_#t~mem16#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short17#1 := 34 == parse_expression_list_#t~mem16#1;" "assume !parse_expression_list_#t~short17#1;havoc parse_expression_list_#t~mem16#1;havoc parse_expression_list_#t~short17#1;" "assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1;" "assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset;" "parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;havoc r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;call write~int#2(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1);parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" [2025-03-17 20:20:38,736 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1;" [2025-03-17 20:20:38,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1017264010, now seen corresponding path program 1 times [2025-03-17 20:20:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:38,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288968704] [2025-03-17 20:20:38,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:38,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:38,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:20:38,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:20:38,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:38,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288968704] [2025-03-17 20:20:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288968704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:38,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:38,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:20:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73449152] [2025-03-17 20:20:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:38,799 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash 84341, now seen corresponding path program 3 times [2025-03-17 20:20:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590956256] [2025-03-17 20:20:38,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:38,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:38,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:38,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:38,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:38,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:38,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:38,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:38,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:38,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:38,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:38,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:38,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:20:38,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:20:38,862 INFO L87 Difference]: Start difference. First operand 127 states and 166 transitions. cyclomatic complexity: 49 Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:38,892 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2025-03-17 20:20:38,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 174 transitions. [2025-03-17 20:20:38,893 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 20:20:38,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 137 states and 173 transitions. [2025-03-17 20:20:38,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 20:20:38,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 20:20:38,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 173 transitions. [2025-03-17 20:20:38,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:38,894 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 173 transitions. [2025-03-17 20:20:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 173 transitions. [2025-03-17 20:20:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2025-03-17 20:20:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.2790697674418605) internal successors, (165), 128 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 165 transitions. [2025-03-17 20:20:38,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 165 transitions. [2025-03-17 20:20:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:20:38,899 INFO L432 stractBuchiCegarLoop]: Abstraction has 129 states and 165 transitions. [2025-03-17 20:20:38,899 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 20:20:38,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 165 transitions. [2025-03-17 20:20:38,900 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 20:20:38,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:38,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:38,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:38,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:38,902 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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 8;havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 8);havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume !parse_expression_list_#t~short14#1;" "assume !parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;" "parse_expression_list_#t~short17#1 := 0 < parse_expression_list_~j~0#1;" "assume !parse_expression_list_#t~short17#1;" "assume !parse_expression_list_#t~short17#1;havoc parse_expression_list_#t~mem16#1;havoc parse_expression_list_#t~short17#1;" "assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1;" "assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset;" "parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;havoc r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;call write~int#2(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1);parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" [2025-03-17 20:20:38,902 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1;" [2025-03-17 20:20:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -779687349, now seen corresponding path program 1 times [2025-03-17 20:20:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622146300] [2025-03-17 20:20:38,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:38,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:20:38,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:20:38,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:38,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:38,984 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-17 20:20:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:39,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:39,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622146300] [2025-03-17 20:20:39,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622146300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:39,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:39,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:20:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031026025] [2025-03-17 20:20:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:39,008 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 84341, now seen corresponding path program 4 times [2025-03-17 20:20:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381191422] [2025-03-17 20:20:39,008 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:20:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:39,011 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-17 20:20:39,013 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:39,013 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:20:39,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:39,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:39,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:39,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:39,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:39,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:39,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:39,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:39,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:20:39,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:20:39,068 INFO L87 Difference]: Start difference. First operand 129 states and 165 transitions. cyclomatic complexity: 46 Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:39,095 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2025-03-17 20:20:39,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 103 transitions. [2025-03-17 20:20:39,096 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:20:39,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 0 states and 0 transitions. [2025-03-17 20:20:39,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:20:39,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:20:39,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:20:39,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:39,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:39,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:20:39,097 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:39,097 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 20:20:39,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:20:39,097 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:20:39,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:20:39,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:20:39 BoogieIcfgContainer [2025-03-17 20:20:39,104 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:20:39,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:20:39,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:20:39,105 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:20:39,106 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:20:16" (3/4) ... [2025-03-17 20:20:39,107 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:20:39,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:20:39,108 INFO L158 Benchmark]: Toolchain (without parser) took 23169.31ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 123.1MB in the beginning and 127.3MB in the end (delta: -4.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2025-03-17 20:20:39,108 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:39,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.56ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 110.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:20:39,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.27ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:39,110 INFO L158 Benchmark]: Boogie Preprocessor took 33.18ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:20:39,110 INFO L158 Benchmark]: IcfgBuilder took 288.46ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 90.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:20:39,111 INFO L158 Benchmark]: BuchiAutomizer took 22626.34ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 90.3MB in the beginning and 129.2MB in the end (delta: -38.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:39,111 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 201.3MB. Free memory was 129.2MB in the beginning and 127.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:39,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.56ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 110.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.27ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.18ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 288.46ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 90.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 22626.34ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 90.3MB in the beginning and 129.2MB in the end (delta: -38.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 201.3MB. Free memory was 129.2MB in the beginning and 127.3MB in the end (delta: 1.9MB). 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~str!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~str!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (11 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function j and consists of 5 locations. 11 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.5s and 16 iterations. TraceHistogramMax:8. Analysis of lassos took 21.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 152 StatesRemovedByMinimization, 8 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 365 mSDsluCounter, 1308 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 889 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 419 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU7 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf100 lsp89 ukn66 mio100 lsp31 div100 bol100 ite100 ukn100 eq172 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms 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-17 20:20:39,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:39,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 20:20:39,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:39,731 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