./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 16:03:18,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:03:18,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:03:18,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:03:18,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:03:18,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:03:18,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:03:18,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:03:18,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:03:18,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:03:18,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:03:18,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:03:18,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:03:18,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:03:18,459 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:03:18,459 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:03:18,459 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:03:18,459 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:03:18,459 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:03:18,459 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:03:18,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:03:18,460 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:03:18,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:03:18,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:03:18,461 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:03:18,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:03:18,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:03:18,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:03:18,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:03:18,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:03:18,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:03:18,462 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:03:18,462 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-04 16:03:18,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:03:18,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:03:18,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:03:18,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:03:18,699 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:03:18,700 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-04 16:03:19,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6ba34c51/5caee2774c72404faf103d7729368d04/FLAG3925c5dca [2025-03-04 16:03:19,998 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:03:19,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-03-04 16:03:20,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6ba34c51/5caee2774c72404faf103d7729368d04/FLAG3925c5dca [2025-03-04 16:03:20,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6ba34c51/5caee2774c72404faf103d7729368d04 [2025-03-04 16:03:20,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:03:20,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:03:20,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:03:20,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:03:20,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:03:20,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23383db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20, skipping insertion in model container [2025-03-04 16:03:20,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:03:20,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:03:20,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:03:20,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:03:20,536 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:03:20,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20 WrapperNode [2025-03-04 16:03:20,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:03:20,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:03:20,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:03:20,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:03:20,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,564 INFO L138 Inliner]: procedures = 42, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 145 [2025-03-04 16:03:20,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:03:20,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:03:20,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:03:20,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:03:20,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,590 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-04 16:03:20,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:03:20,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:03:20,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:03:20,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:03:20,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (1/1) ... [2025-03-04 16:03:20,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:20,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:20,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:20,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:03:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:03:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 16:03:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 16:03:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 16:03:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 16:03:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 16:03:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 16:03:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 16:03:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:03:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 16:03:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 16:03:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:03:20,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:03:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 16:03:20,733 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:03:20,734 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:03:20,929 INFO L1325 $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-04 16:03:20,929 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset; [2025-03-04 16:03:20,929 INFO L1325 $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-04 16:03:20,957 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-04 16:03:20,957 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:03:20,966 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:03:20,966 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:03:20,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:03:20 BoogieIcfgContainer [2025-03-04 16:03:20,967 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:03:20,967 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:03:20,967 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:03:20,971 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:03:20,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:03:20,972 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:03:20" (1/3) ... [2025-03-04 16:03:20,973 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60940aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:03:20, skipping insertion in model container [2025-03-04 16:03:20,973 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:03:20,973 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:03:20" (2/3) ... [2025-03-04 16:03:20,973 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60940aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:03:20, skipping insertion in model container [2025-03-04 16:03:20,973 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:03:20,973 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:03:20" (3/3) ... [2025-03-04 16:03:20,974 INFO L363 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-03-04 16:03:21,009 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:03:21,009 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:03:21,009 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:03:21,009 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:03:21,009 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:03:21,009 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:03:21,010 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:03:21,010 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:03:21,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 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-04 16:03:21,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-03-04 16:03:21,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:21,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:21,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:03:21,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:03:21,026 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:03:21,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 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-04 16:03:21,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-03-04 16:03:21,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:21,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:21,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:03:21,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:03:21,031 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-04 16:03:21,031 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-04 16:03:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 3168, now seen corresponding path program 1 times [2025-03-04 16:03:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327668329] [2025-03-04 16:03:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:21,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:03:21,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:03:21,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:21,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:21,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:21,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:03:21,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:03:21,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:21,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:21,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:21,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash 98, now seen corresponding path program 1 times [2025-03-04 16:03:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564600351] [2025-03-04 16:03:21,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:21,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:03:21,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:03:21,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:21,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:21,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:21,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:03:21,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:03:21,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:21,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:21,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash 98275, now seen corresponding path program 1 times [2025-03-04 16:03:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109344384] [2025-03-04 16:03:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:21,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:21,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:21,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:21,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:21,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:21,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:21,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:21,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:21,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:21,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:21,445 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:03:21,446 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:03:21,446 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:03:21,446 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:03:21,446 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:03:21,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:03:21,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:03:21,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2025-03-04 16:03:21,450 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:03:21,450 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:03:21,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:21,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:21,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:21,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:21,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:21,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:21,798 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:03:21,801 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:03:21,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:21,805 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-04 16:03:21,806 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-04 16:03:21,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:21,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:21,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:21,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:21,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:21,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:21,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:21,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:21,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:21,832 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-04 16:03:21,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:21,836 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-04 16:03:21,837 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-04 16:03:21,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:21,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:21,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:21,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:21,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:21,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:21,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:21,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:21,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:21,857 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-04 16:03:21,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:21,860 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-04 16:03:21,861 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-04 16:03:21,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:21,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:21,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:21,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:21,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:21,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:21,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:21,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:21,884 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-04 16:03:21,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:21,887 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-04 16:03:21,888 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-04 16:03:21,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-04 16:03:21,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:21,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:21,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:21,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:21,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:21,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:21,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:21,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 16:03:21,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:21,915 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-04 16:03:21,916 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-04 16:03:21,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:21,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:21,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:21,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:21,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:21,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:21,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:21,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:21,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:21,936 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-04 16:03:21,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:21,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:21,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:03:21,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:21,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:21,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:21,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:21,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:21,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:21,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:21,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:21,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 16:03:21,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:21,965 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:21,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 16:03:21,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:21,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:21,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:21,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:21,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:21,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:21,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:21,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:21,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 16:03:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:21,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:21,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 16:03:21,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:22,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:22,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:22,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:22,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:22,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:22,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:22,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:22,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 16:03:22,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:22,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:22,022 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:22,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 16:03:22,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:22,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:22,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:22,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:22,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:22,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:22,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:22,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:22,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 16:03:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:22,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 16:03:22,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:22,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:22,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:22,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:22,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:22,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:22,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:22,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:22,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:22,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:22,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:22,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:22,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 16:03:22,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:22,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:22,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:22,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:22,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:22,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:22,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:22,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:22,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:22,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 16:03:22,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:22,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:22,105 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:22,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 16:03:22,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-04 16:03:22,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:22,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:22,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:22,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:22,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:22,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:22,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:22,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:22,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:22,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:22,135 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:22,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 16:03:22,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:22,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:22,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:22,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:22,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:22,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:22,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:22,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:03:22,185 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 16:03:22,187 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 16:03:22,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:22,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:22,190 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:22,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 16:03:22,193 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:03:22,204 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:03:22,205 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:03:22,205 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-04 16:03:22,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:22,223 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 16:03:22,231 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:03:22,232 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:03:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:22,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:03:22,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:03:22,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:22,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:22,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:03:22,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:22,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:03:22,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:03:22,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:22,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:22,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:03:22,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:03:22,299 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-04 16:03:22,301 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 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.5) 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-04 16:03:22,326 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 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.5) 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) Result 36 states and 55 transitions. Complement of second has 3 states. [2025-03-04 16:03:22,328 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-04 16:03:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) 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-04 16:03:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-04 16:03:22,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-04 16:03:22,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:22,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-04 16:03:22,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:22,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 16:03:22,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:22,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 55 transitions. [2025-03-04 16:03:22,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-03-04 16:03:22,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 46 transitions. [2025-03-04 16:03:22,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-04 16:03:22,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-03-04 16:03:22,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2025-03-04 16:03:22,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:03:22,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 46 transitions. [2025-03-04 16:03:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2025-03-04 16:03:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 16:03:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 30 states have internal predecessors, (46), 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-04 16:03:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2025-03-04 16:03:22,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 46 transitions. [2025-03-04 16:03:22,367 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2025-03-04 16:03:22,367 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:03:22,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 46 transitions. [2025-03-04 16:03:22,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-03-04 16:03:22,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:22,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:22,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:03:22,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:03:22,369 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-04 16:03:22,369 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-04 16:03:22,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash 3046559, now seen corresponding path program 1 times [2025-03-04 16:03:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:22,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737657287] [2025-03-04 16:03:22,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:22,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:22,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:22,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:22,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:22,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:03:22,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737657287] [2025-03-04 16:03:22,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737657287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:22,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:22,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:03:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442395672] [2025-03-04 16:03:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:22,445 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:03:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2798718, now seen corresponding path program 1 times [2025-03-04 16:03:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397459896] [2025-03-04 16:03:22,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:22,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:22,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:22,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:22,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:22,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:22,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:22,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:22,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:22,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:22,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:22,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:22,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:03:22,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:03:22,514 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:22,525 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-04 16:03:22,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2025-03-04 16:03:22,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 16:03:22,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 38 transitions. [2025-03-04 16:03:22,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 16:03:22,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 16:03:22,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2025-03-04 16:03:22,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:03:22,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-04 16:03:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2025-03-04 16:03:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 16:03:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 27 states have internal predecessors, (38), 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-04 16:03:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-03-04 16:03:22,532 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-04 16:03:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:03:22,533 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-04 16:03:22,533 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:03:22,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2025-03-04 16:03:22,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 16:03:22,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:22,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:22,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:03:22,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:03:22,535 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-04 16:03:22,536 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-04 16:03:22,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash 94444386, now seen corresponding path program 1 times [2025-03-04 16:03:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:22,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156030635] [2025-03-04 16:03:22,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:22,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:22,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:22,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:22,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:22,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:22,622 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-04 16:03:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156030635] [2025-03-04 16:03:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156030635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:03:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176079395] [2025-03-04 16:03:22,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:22,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:03:22,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:22,628 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:03:22,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 16:03:22,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:22,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:22,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:22,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:22,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 16:03:22,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:22,688 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-04 16:03:22,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:03:22,704 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-04 16:03:22,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176079395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:03:22,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:03:22,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 16:03:22,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369854159] [2025-03-04 16:03:22,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:03:22,705 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:03:22,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2798718, now seen corresponding path program 2 times [2025-03-04 16:03:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:22,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545941122] [2025-03-04 16:03:22,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:03:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:22,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:22,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:22,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:03:22,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:22,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:22,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:22,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:22,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:22,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:22,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:22,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 16:03:22,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:03:22,786 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-04 16:03:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:22,801 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-03-04 16:03:22,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2025-03-04 16:03:22,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 16:03:22,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2025-03-04 16:03:22,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 16:03:22,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 16:03:22,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2025-03-04 16:03:22,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:03:22,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-04 16:03:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2025-03-04 16:03:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 16:03:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 states have internal predecessors, (41), 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-04 16:03:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-03-04 16:03:22,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-04 16:03:22,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:03:22,805 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-04 16:03:22,805 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:03:22,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2025-03-04 16:03:22,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 16:03:22,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:22,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:22,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2025-03-04 16:03:22,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:03:22,806 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-04 16:03:22,806 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-04 16:03:22,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 390174047, now seen corresponding path program 2 times [2025-03-04 16:03:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339434268] [2025-03-04 16:03:22,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:03:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:22,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 16:03:22,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:03:22,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:03:22,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:22,882 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-04 16:03:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339434268] [2025-03-04 16:03:22,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339434268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:03:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928926923] [2025-03-04 16:03:22,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:03:22,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:03:22,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:22,885 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:03:22,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 16:03:22,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 16:03:22,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:03:22,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:03:22,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:22,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:03:22,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:22,959 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-04 16:03:22,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:03:22,996 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-04 16:03:22,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928926923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:03:22,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:03:22,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 16:03:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749901247] [2025-03-04 16:03:22,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:03:22,998 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:03:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2798718, now seen corresponding path program 3 times [2025-03-04 16:03:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485266573] [2025-03-04 16:03:22,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:03:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:23,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:23,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:23,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:03:23,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:23,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:23,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:23,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:23,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:23,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:23,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:23,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 16:03:23,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 16:03:23,058 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-04 16:03:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:23,079 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-03-04 16:03:23,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2025-03-04 16:03:23,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 16:03:23,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2025-03-04 16:03:23,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 16:03:23,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 16:03:23,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2025-03-04 16:03:23,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:03:23,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-04 16:03:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2025-03-04 16:03:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 16:03:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 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-04 16:03:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-03-04 16:03:23,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-04 16:03:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 16:03:23,087 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-04 16:03:23,087 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:03:23,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2025-03-04 16:03:23,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 16:03:23,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:23,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:23,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1] [2025-03-04 16:03:23,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:03:23,089 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-04 16:03:23,089 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-04 16:03:23,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash -912634337, now seen corresponding path program 3 times [2025-03-04 16:03:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:23,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667202286] [2025-03-04 16:03:23,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:03:23,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:23,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 5 equivalence classes. [2025-03-04 16:03:23,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:03:23,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 16:03:23,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:23,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:23,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:03:23,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:03:23,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:23,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:23,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:23,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2798718, now seen corresponding path program 4 times [2025-03-04 16:03:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706207803] [2025-03-04 16:03:23,136 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:03:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:23,139 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-03-04 16:03:23,140 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:23,140 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:03:23,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:23,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:23,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:23,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:23,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:23,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:23,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:23,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:23,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1181432932, now seen corresponding path program 1 times [2025-03-04 16:03:23,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:23,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202219625] [2025-03-04 16:03:23,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:23,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:23,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:03:23,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:03:23,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:23,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:23,161 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:23,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:03:23,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:03:23,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:23,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:23,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:26,299 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:03:26,299 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:03:26,299 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:03:26,299 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:03:26,299 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:03:26,299 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:26,299 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:03:26,299 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:03:26,299 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration5_Lasso [2025-03-04 16:03:26,299 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:03:26,299 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:03:26,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:26,887 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:03:26,887 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:03:26,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:26,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:26,889 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:26,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:03:26,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:26,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:26,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:26,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:26,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:26,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:26,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:26,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:26,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:26,910 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-04 16:03:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:26,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:26,913 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:26,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:03:26,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:26,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:26,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:26,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:26,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:26,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:26,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:26,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:26,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:26,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 16:03:26,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:26,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:26,933 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:26,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 16:03:26,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:26,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:26,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:26,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:26,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:26,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:26,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:26,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:26,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:26,952 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-04 16:03:26,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:26,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:26,953 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:26,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:03:26,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:26,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:26,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:26,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:26,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:26,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:26,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:26,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:26,976 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-04 16:03:26,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:26,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:26,978 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:26,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 16:03:26,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:26,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:26,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:26,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:26,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:26,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:26,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:26,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 16:03:27,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,003 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 16:03:27,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:27,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:27,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,026 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-04 16:03:27,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,028 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 16:03:27,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:27,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:27,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:27,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,050 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 16:03:27,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:27,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:27,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:27,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,071 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-04 16:03:27,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,073 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 16:03:27,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:27,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:27,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,099 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-04 16:03:27,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,102 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 16:03:27,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:27,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:27,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:27,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,124 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 16:03:27,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:27,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:27,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:27,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,151 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 16:03:27,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:27,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:27,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:27,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:27,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,173 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 16:03:27,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:27,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:27,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:27,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:27,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,198 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 16:03:27,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:27,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:27,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:27,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:27,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:27,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:27,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:27,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:03:27,232 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-04 16:03:27,233 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 16:03:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:27,235 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:27,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 16:03:27,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:03:27,248 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 16:03:27,248 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:03:27,248 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_2, ULTIMATE.start_parse_expression_list_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_2 - 1*ULTIMATE.start_parse_expression_list_~i~0#1 Supporting invariants [1*ULTIMATE.start_parse_expression_list_~str#1.offset >= 0] [2025-03-04 16:03:27,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:27,286 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-04 16:03:27,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:03:27,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:03:27,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:27,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:03:27,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:03:27,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:27,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:27,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 16:03:27,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:27,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:03:27,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:03:27,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:27,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:27,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 16:03:27,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:03:27,438 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-04 16:03:27,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-04 16:03:27,494 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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) Result 60 states and 79 transitions. Complement of second has 6 states. [2025-03-04 16:03:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:03:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-04 16:03:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2025-03-04 16:03:27,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-04 16:03:27,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:27,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 16 letters. Loop has 4 letters. [2025-03-04 16:03:27,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:27,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 12 letters. Loop has 8 letters. [2025-03-04 16:03:27,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:27,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2025-03-04 16:03:27,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:27,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 48 states and 64 transitions. [2025-03-04 16:03:27,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 16:03:27,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-04 16:03:27,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2025-03-04 16:03:27,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:27,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 64 transitions. [2025-03-04 16:03:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2025-03-04 16:03:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-03-04 16:03:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 46 states have internal predecessors, (63), 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-04 16:03:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2025-03-04 16:03:27,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-03-04 16:03:27,504 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-03-04 16:03:27,504 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:03:27,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 63 transitions. [2025-03-04 16:03:27,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:27,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:27,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:27,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1] [2025-03-04 16:03:27,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:03:27,505 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-04 16:03:27,505 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-04 16:03:27,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:27,505 INFO L85 PathProgramCache]: Analyzing trace with hash -868267523, now seen corresponding path program 1 times [2025-03-04 16:03:27,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898243784] [2025-03-04 16:03:27,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:27,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:03:27,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:03:27,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:27,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:27,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:27,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:03:27,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:03:27,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:27,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:27,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:27,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 86327, now seen corresponding path program 1 times [2025-03-04 16:03:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:27,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075272505] [2025-03-04 16:03:27,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:27,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:27,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:27,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:27,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:27,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:27,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:27,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:27,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:27,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:27,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:27,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2030302651, now seen corresponding path program 1 times [2025-03-04 16:03:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:27,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238178748] [2025-03-04 16:03:27,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:27,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:03:27,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:03:27,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:27,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:27,767 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-04 16:03:27,888 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-04 16:03:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:27,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238178748] [2025-03-04 16:03:27,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238178748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:27,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:27,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:03:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308223783] [2025-03-04 16:03:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:27,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:27,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 16:03:27,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:03:27,950 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. cyclomatic complexity: 20 Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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-04 16:03:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:28,027 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2025-03-04 16:03:28,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 105 transitions. [2025-03-04 16:03:28,028 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:03:28,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 105 transitions. [2025-03-04 16:03:28,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 16:03:28,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 16:03:28,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 105 transitions. [2025-03-04 16:03:28,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:28,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 105 transitions. [2025-03-04 16:03:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 105 transitions. [2025-03-04 16:03:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2025-03-04 16:03:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 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-04 16:03:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2025-03-04 16:03:28,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-03-04 16:03:28,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:03:28,037 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-03-04 16:03:28,037 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:03:28,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2025-03-04 16:03:28,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:28,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:28,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:28,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:03:28,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:03:28,038 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-04 16:03:28,038 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-04 16:03:28,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1485679558, now seen corresponding path program 1 times [2025-03-04 16:03:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805027595] [2025-03-04 16:03:28,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:28,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 16:03:28,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 16:03:28,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:28,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:28,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:28,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 16:03:28,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 16:03:28,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:28,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:28,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 86327, now seen corresponding path program 2 times [2025-03-04 16:03:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:28,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623536862] [2025-03-04 16:03:28,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:03:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:28,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:28,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:28,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:03:28,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:28,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:28,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:28,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:28,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:28,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -241670562, now seen corresponding path program 1 times [2025-03-04 16:03:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682754943] [2025-03-04 16:03:28,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:28,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 16:03:28,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 16:03:28,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:28,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:28,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:28,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 16:03:28,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 16:03:28,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:28,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:28,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:34,244 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 246 DAG size of output: 179 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 16:03:34,385 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:03:34,386 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:03:34,386 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:03:34,386 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:03:34,386 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:03:34,386 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:34,386 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:03:34,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:03:34,386 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2025-03-04 16:03:34,386 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:03:34,386 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:03:34,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:34,932 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:03:34,932 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:03:34,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:34,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:34,936 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:34,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 16:03:34,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:34,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:34,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:34,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:34,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:34,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:34,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:34,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:34,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:34,953 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-04 16:03:34,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:34,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:34,955 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:34,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 16:03:34,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:34,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:34,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:34,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:34,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:34,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:34,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:34,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:34,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:34,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 16:03:34,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:34,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:34,975 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:34,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 16:03:34,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:34,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:34,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:34,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:34,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:34,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:34,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:34,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:34,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:34,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 16:03:34,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:34,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:34,996 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:34,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 16:03:34,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 16:03:35,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,016 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 16:03:35,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 16:03:35,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,039 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 16:03:35,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 16:03:35,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,060 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 16:03:35,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:35,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,082 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 16:03:35,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 16:03:35,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,104 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 16:03:35,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,125 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 16:03:35,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,138 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 16:03:35,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,145 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 16:03:35,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,163 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-04 16:03:35,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,165 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 16:03:35,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-04 16:03:35,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,191 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-04 16:03:35,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,193 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 16:03:35,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 16:03:35,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,214 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 16:03:35,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-04 16:03:35,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,239 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 16:03:35,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-04 16:03:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,263 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 16:03:35,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,283 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-04 16:03:35,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,285 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 16:03:35,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 16:03:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,304 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 16:03:35,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 16:03:35,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,326 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 16:03:35,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 16:03:35,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,364 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 16:03:35,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-04 16:03:35,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,386 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 16:03:35,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,409 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-04 16:03:35,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,411 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 16:03:35,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,433 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-04 16:03:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,436 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 16:03:35,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,459 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 16:03:35,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-04 16:03:35,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 16:03:35,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,478 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 16:03:35,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-04 16:03:35,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 16:03:35,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,498 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 16:03:35,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 16:03:35,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,520 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 16:03:35,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 16:03:35,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,544 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 16:03:35,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:35,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,569 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 16:03:35,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-04 16:03:35,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:35,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:35,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:35,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:35,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-04 16:03:35,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,591 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 16:03:35,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:35,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:35,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:35,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:35,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:35,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:35,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:35,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:03:35,631 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-04 16:03:35,631 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-04 16:03:35,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:35,633 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:35,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 16:03:35,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:03:35,645 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 16:03:35,645 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:03:35,645 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_3, ULTIMATE.start_parse_expression_list_~start~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_3 - 1*ULTIMATE.start_parse_expression_list_~start~0#1 Supporting invariants [1*ULTIMATE.start_parse_expression_list_~str#1.offset >= 0] [2025-03-04 16:03:35,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 16:03:35,676 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-04 16:03:35,680 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:03:35,680 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:03:35,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:35,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 16:03:35,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 16:03:35,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:35,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:35,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 16:03:35,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:35,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:35,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:35,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:35,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:35,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 16:03:35,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:35,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 16:03:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:03:35,854 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-04 16:03:35,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 72 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-04 16:03:35,931 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 72 transitions. cyclomatic complexity: 22. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 160 states and 221 transitions. Complement of second has 9 states. [2025-03-04 16:03:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:03:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-04 16:03:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2025-03-04 16:03:35,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 18 letters. Loop has 3 letters. [2025-03-04 16:03:35,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:35,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 21 letters. Loop has 3 letters. [2025-03-04 16:03:35,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:35,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 18 letters. Loop has 6 letters. [2025-03-04 16:03:35,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:35,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 221 transitions. [2025-03-04 16:03:35,935 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:03:35,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 122 states and 167 transitions. [2025-03-04 16:03:35,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-04 16:03:35,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-03-04 16:03:35,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 167 transitions. [2025-03-04 16:03:35,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:35,936 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 167 transitions. [2025-03-04 16:03:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 167 transitions. [2025-03-04 16:03:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2025-03-04 16:03:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 78 states have internal predecessors, (110), 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-04 16:03:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2025-03-04 16:03:35,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 110 transitions. [2025-03-04 16:03:35,941 INFO L432 stractBuchiCegarLoop]: Abstraction has 79 states and 110 transitions. [2025-03-04 16:03:35,941 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:03:35,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 110 transitions. [2025-03-04 16:03:35,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:35,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:35,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:35,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:03:35,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:03:35,942 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-04 16:03:35,942 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-04 16:03:35,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1278133802, now seen corresponding path program 1 times [2025-03-04 16:03:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:35,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390588630] [2025-03-04 16:03:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:35,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:35,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:03:35,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:03:35,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:35,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:35,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:35,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:03:35,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:03:35,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:35,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:35,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:35,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash 74439, now seen corresponding path program 1 times [2025-03-04 16:03:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216491362] [2025-03-04 16:03:35,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:35,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:35,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:35,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:35,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:03:35,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:35,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216491362] [2025-03-04 16:03:35,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216491362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:35,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:35,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 16:03:35,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475418283] [2025-03-04 16:03:35,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:35,986 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:03:35,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:35,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:03:35,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:03:35,987 INFO L87 Difference]: Start difference. First operand 79 states and 110 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-04 16:03:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:35,994 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2025-03-04 16:03:35,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 111 transitions. [2025-03-04 16:03:35,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:35,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 110 transitions. [2025-03-04 16:03:35,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 16:03:35,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 16:03:35,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 110 transitions. [2025-03-04 16:03:35,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:35,996 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 110 transitions. [2025-03-04 16:03:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 110 transitions. [2025-03-04 16:03:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 16:03:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.375) internal successors, (110), 79 states have internal predecessors, (110), 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-04 16:03:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2025-03-04 16:03:35,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 110 transitions. [2025-03-04 16:03:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:03:35,999 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 110 transitions. [2025-03-04 16:03:35,999 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:03:35,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 110 transitions. [2025-03-04 16:03:35,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:35,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:35,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:36,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:03:36,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:03:36,000 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-04 16:03:36,000 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-04 16:03:36,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1278133833, now seen corresponding path program 1 times [2025-03-04 16:03:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021553217] [2025-03-04 16:03:36,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:03:36,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:03:36,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:36,209 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-04 16:03:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:36,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021553217] [2025-03-04 16:03:36,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021553217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:36,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 16:03:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120470455] [2025-03-04 16:03:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:36,210 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:03:36,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,211 INFO L85 PathProgramCache]: Analyzing trace with hash 71509289, now seen corresponding path program 1 times [2025-03-04 16:03:36,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112155928] [2025-03-04 16:03:36,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:36,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:36,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:36,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:36,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:36,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:36,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 16:03:36,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:03:36,293 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. cyclomatic complexity: 37 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-04 16:03:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:36,368 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2025-03-04 16:03:36,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 145 transitions. [2025-03-04 16:03:36,370 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:03:36,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 103 states and 137 transitions. [2025-03-04 16:03:36,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-04 16:03:36,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-03-04 16:03:36,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 137 transitions. [2025-03-04 16:03:36,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:36,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 137 transitions. [2025-03-04 16:03:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 137 transitions. [2025-03-04 16:03:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2025-03-04 16:03:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.368421052631579) internal successors, (104), 75 states have internal predecessors, (104), 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-04 16:03:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2025-03-04 16:03:36,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-03-04 16:03:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:03:36,377 INFO L432 stractBuchiCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-03-04 16:03:36,378 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:03:36,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 104 transitions. [2025-03-04 16:03:36,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:36,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:36,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:36,378 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:03:36,378 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:03:36,378 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-04 16:03:36,379 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-04 16:03:36,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1278133802, now seen corresponding path program 2 times [2025-03-04 16:03:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302090961] [2025-03-04 16:03:36,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:03:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 16:03:36,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:03:36,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:03:36,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:36,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:03:36,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:03:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash 71509289, now seen corresponding path program 2 times [2025-03-04 16:03:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994690579] [2025-03-04 16:03:36,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:03:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:36,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:36,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:03:36,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:36,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:36,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:36,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:36,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1161443212, now seen corresponding path program 1 times [2025-03-04 16:03:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186123446] [2025-03-04 16:03:36,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:03:36,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:03:36,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:36,494 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-04 16:03:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186123446] [2025-03-04 16:03:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186123446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:36,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:03:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932083939] [2025-03-04 16:03:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:36,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:36,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:03:36,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:03:36,562 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. cyclomatic complexity: 35 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:36,613 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2025-03-04 16:03:36,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 132 transitions. [2025-03-04 16:03:36,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:36,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 95 states and 124 transitions. [2025-03-04 16:03:36,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-04 16:03:36,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-04 16:03:36,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 124 transitions. [2025-03-04 16:03:36,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:36,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 124 transitions. [2025-03-04 16:03:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 124 transitions. [2025-03-04 16:03:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2025-03-04 16:03:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.3375) internal successors, (107), 79 states have internal predecessors, (107), 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-04 16:03:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2025-03-04 16:03:36,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 107 transitions. [2025-03-04 16:03:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:03:36,618 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 107 transitions. [2025-03-04 16:03:36,618 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:03:36,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 107 transitions. [2025-03-04 16:03:36,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 16:03:36,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:36,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:36,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:03:36,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:03:36,619 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-04 16:03:36,619 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-04 16:03:36,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1241581131, now seen corresponding path program 1 times [2025-03-04 16:03:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318840762] [2025-03-04 16:03:36,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:36,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:03:36,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:03:36,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:36,643 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-04 16:03:36,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318840762] [2025-03-04 16:03:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318840762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:36,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:03:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683569008] [2025-03-04 16:03:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:36,644 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:03:36,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash 71509289, now seen corresponding path program 3 times [2025-03-04 16:03:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930827733] [2025-03-04 16:03:36,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:03:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:36,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:36,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:03:36,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:36,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:36,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:36,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:36,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:03:36,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:03:36,718 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:03:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:36,724 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2025-03-04 16:03:36,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 111 transitions. [2025-03-04 16:03:36,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-04 16:03:36,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 109 transitions. [2025-03-04 16:03:36,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 16:03:36,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 16:03:36,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 109 transitions. [2025-03-04 16:03:36,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:36,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 109 transitions. [2025-03-04 16:03:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 109 transitions. [2025-03-04 16:03:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 16:03:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 83 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-04 16:03:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2025-03-04 16:03:36,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 109 transitions. [2025-03-04 16:03:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:03:36,728 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 109 transitions. [2025-03-04 16:03:36,728 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:03:36,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 109 transitions. [2025-03-04 16:03:36,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-04 16:03:36,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:36,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:36,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:03:36,729 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:03:36,729 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-04 16:03:36,729 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-04 16:03:36,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1242504652, now seen corresponding path program 1 times [2025-03-04 16:03:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374541383] [2025-03-04 16:03:36,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:36,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:03:36,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:03:36,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:36,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:03:36,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:03:36,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:36,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 71509289, now seen corresponding path program 4 times [2025-03-04 16:03:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060761427] [2025-03-04 16:03:36,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:03:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-04 16:03:36,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:36,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:03:36,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:36,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:36,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:36,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:36,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:36,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2104055082, now seen corresponding path program 1 times [2025-03-04 16:03:36,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:36,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754377523] [2025-03-04 16:03:36,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:36,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 16:03:36,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 16:03:36,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:36,850 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-04 16:03:36,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754377523] [2025-03-04 16:03:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754377523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:03:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064499008] [2025-03-04 16:03:36,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:36,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:03:36,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:36,853 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:03:36,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-03-04 16:03:36,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 16:03:36,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 16:03:36,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:36,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:36,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:03:36,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:36,946 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-04 16:03:36,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:03:36,974 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-04 16:03:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064499008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:03:36,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:03:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-04 16:03:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224576163] [2025-03-04 16:03:36,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:03:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:37,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 16:03:37,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:03:37,033 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-04 16:03:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:37,105 INFO L93 Difference]: Finished difference Result 155 states and 200 transitions. [2025-03-04 16:03:37,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 200 transitions. [2025-03-04 16:03:37,106 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 16:03:37,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 139 states and 178 transitions. [2025-03-04 16:03:37,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-04 16:03:37,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-04 16:03:37,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 178 transitions. [2025-03-04 16:03:37,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:37,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 178 transitions. [2025-03-04 16:03:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 178 transitions. [2025-03-04 16:03:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2025-03-04 16:03:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 122 states have internal predecessors, (160), 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-04 16:03:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2025-03-04 16:03:37,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 160 transitions. [2025-03-04 16:03:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 16:03:37,115 INFO L432 stractBuchiCegarLoop]: Abstraction has 123 states and 160 transitions. [2025-03-04 16:03:37,115 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 16:03:37,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 160 transitions. [2025-03-04 16:03:37,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:03:37,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:37,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:37,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:03:37,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:03:37,116 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-04 16:03:37,116 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-04 16:03:37,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash -690093007, now seen corresponding path program 2 times [2025-03-04 16:03:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923900658] [2025-03-04 16:03:37,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:03:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:37,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 16:03:37,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 16:03:37,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:03:37,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:37,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:37,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 16:03:37,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 16:03:37,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:37,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:37,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:37,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash 71509289, now seen corresponding path program 5 times [2025-03-04 16:03:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75105760] [2025-03-04 16:03:37,155 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:03:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:37,158 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:37,159 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:37,159 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:03:37,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:37,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:37,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:37,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:37,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:37,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:37,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash -311410951, now seen corresponding path program 2 times [2025-03-04 16:03:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:37,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927260096] [2025-03-04 16:03:37,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:03:37,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:37,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 16:03:37,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 16:03:37,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:03:37,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:37,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:37,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 16:03:37,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 16:03:37,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:37,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:37,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:44,107 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 303 DAG size of output: 213 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 16:03:44,253 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:03:44,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:03:44,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:03:44,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:03:44,254 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:03:44,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:03:44,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:03:44,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration13_Lasso [2025-03-04 16:03:44,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:03:44,254 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:03:44,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:03:44,815 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:03:44,815 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:03:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,818 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 16:03:44,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:44,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:44,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:44,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:44,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 16:03:44,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,838 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 16:03:44,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:44,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:44,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:44,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:44,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 16:03:44,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,858 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 16:03:44,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:44,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:44,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:44,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:44,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 16:03:44,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,878 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 16:03:44,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:44,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:44,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:44,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:44,896 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-04 16:03:44,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,898 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 16:03:44,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:44,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:44,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:44,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:44,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 16:03:44,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,918 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 16:03:44,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:44,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:44,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:44,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:44,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-04 16:03:44,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,938 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-04 16:03:44,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:44,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:44,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:44,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:44,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-04 16:03:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,959 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-04 16:03:44,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:44,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:44,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:44,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-04 16:03:44,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:44,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:44,981 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:44,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 16:03:44,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:44,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:44,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:44,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:44,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:44,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:44,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:44,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 16:03:45,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,002 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 16:03:45,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:45,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:45,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,024 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-04 16:03:45,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,026 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 16:03:45,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-04 16:03:45,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,045 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-04 16:03:45,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-04 16:03:45,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,064 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-04 16:03:45,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-04 16:03:45,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,084 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-04 16:03:45,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-04 16:03:45,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:45,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,105 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-04 16:03:45,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 16:03:45,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,126 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-04 16:03:45,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:45,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:45,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-04 16:03:45,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,149 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-04 16:03:45,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-04 16:03:45,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,172 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-04 16:03:45,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-04 16:03:45,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,192 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-04 16:03:45,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-04 16:03:45,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,212 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-04 16:03:45,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-04 16:03:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,232 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-04 16:03:45,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:45,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,251 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-04 16:03:45,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:03:45,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:03:45,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:03:45,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-04 16:03:45,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,271 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-04 16:03:45,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:45,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:45,286 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:45,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,293 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-04 16:03:45,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:45,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:45,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-04 16:03:45,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,315 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-04 16:03:45,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:45,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:45,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:03:45,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-04 16:03:45,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,338 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-04 16:03:45,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:03:45,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:03:45,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:03:45,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:03:45,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:03:45,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:03:45,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:03:45,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:03:45,369 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 16:03:45,369 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-04 16:03:45,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:03:45,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:03:45,371 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:03:45,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-04 16:03:45,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:03:45,383 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:03:45,383 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:03:45,383 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-04 16:03:45,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:45,409 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-04 16:03:45,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:45,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 16:03:45,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 16:03:45,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:45,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:03:45,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:45,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:03:45,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:03:45,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:45,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:03:45,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:03:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:03:45,501 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-04 16:03:45,501 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 160 transitions. cyclomatic complexity: 47 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-04 16:03:45,564 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 160 transitions. cyclomatic complexity: 47. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) Result 193 states and 248 transitions. Complement of second has 9 states. [2025-03-04 16:03:45,564 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-04 16:03:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-04 16:03:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-03-04 16:03:45,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 28 letters. Loop has 5 letters. [2025-03-04 16:03:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:45,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 33 letters. Loop has 5 letters. [2025-03-04 16:03:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:45,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 28 letters. Loop has 10 letters. [2025-03-04 16:03:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:03:45,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 248 transitions. [2025-03-04 16:03:45,566 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:03:45,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 146 states and 187 transitions. [2025-03-04 16:03:45,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-04 16:03:45,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-04 16:03:45,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 187 transitions. [2025-03-04 16:03:45,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:45,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 187 transitions. [2025-03-04 16:03:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 187 transitions. [2025-03-04 16:03:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2025-03-04 16:03:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.3046875) internal successors, (167), 127 states have internal predecessors, (167), 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-04 16:03:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2025-03-04 16:03:45,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 167 transitions. [2025-03-04 16:03:45,570 INFO L432 stractBuchiCegarLoop]: Abstraction has 128 states and 167 transitions. [2025-03-04 16:03:45,570 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 16:03:45,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 167 transitions. [2025-03-04 16:03:45,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:03:45,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:45,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:45,575 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, 1] [2025-03-04 16:03:45,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:03:45,575 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;parse_expression_list_#t~post18#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post18#1 - 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-04 16:03:45,575 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-04 16:03:45,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -298961713, now seen corresponding path program 1 times [2025-03-04 16:03:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924639990] [2025-03-04 16:03:45,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:45,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 16:03:45,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 16:03:45,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:45,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:45,603 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-04 16:03:45,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:45,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924639990] [2025-03-04 16:03:45,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924639990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:45,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:45,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:03:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576255884] [2025-03-04 16:03:45,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:45,604 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:03:45,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash 86327, now seen corresponding path program 3 times [2025-03-04 16:03:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:45,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334540145] [2025-03-04 16:03:45,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:03:45,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:45,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:45,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:45,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:03:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:45,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:45,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:45,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:45,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:45,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:45,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:45,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:03:45,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:03:45,661 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. cyclomatic complexity: 49 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04 16:03:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:45,667 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2025-03-04 16:03:45,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 170 transitions. [2025-03-04 16:03:45,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:03:45,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 131 states and 169 transitions. [2025-03-04 16:03:45,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-04 16:03:45,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-04 16:03:45,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 169 transitions. [2025-03-04 16:03:45,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:45,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 131 states and 169 transitions. [2025-03-04 16:03:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 169 transitions. [2025-03-04 16:03:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-03-04 16:03:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 128 states have internal predecessors, (167), 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-04 16:03:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2025-03-04 16:03:45,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 167 transitions. [2025-03-04 16:03:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:03:45,672 INFO L432 stractBuchiCegarLoop]: Abstraction has 129 states and 167 transitions. [2025-03-04 16:03:45,672 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 16:03:45,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 167 transitions. [2025-03-04 16:03:45,672 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:03:45,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:45,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:45,673 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, 1] [2025-03-04 16:03:45,673 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:03:45,673 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(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;parse_expression_list_#t~post18#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post18#1 - 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-04 16:03:45,673 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-04 16:03:45,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1497989646, now seen corresponding path program 1 times [2025-03-04 16:03:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612408244] [2025-03-04 16:03:45,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:45,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 16:03:45,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 16:03:45,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:45,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:45,749 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-04 16:03:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:45,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612408244] [2025-03-04 16:03:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612408244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:03:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523239086] [2025-03-04 16:03:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:45,751 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:03:45,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash 86327, now seen corresponding path program 4 times [2025-03-04 16:03:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:45,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671955110] [2025-03-04 16:03:45,752 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:03:45,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:45,755 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 16:03:45,755 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:45,755 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:03:45,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:45,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:45,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:45,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:45,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:45,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:45,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:45,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:03:45,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:03:45,807 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. cyclomatic complexity: 48 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-04 16:03:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:45,841 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2025-03-04 16:03:45,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 173 transitions. [2025-03-04 16:03:45,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:03:45,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 173 transitions. [2025-03-04 16:03:45,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-04 16:03:45,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-04 16:03:45,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 173 transitions. [2025-03-04 16:03:45,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:03:45,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 173 transitions. [2025-03-04 16:03:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 173 transitions. [2025-03-04 16:03:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2025-03-04 16:03:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 129 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-04 16:03:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2025-03-04 16:03:45,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 166 transitions. [2025-03-04 16:03:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:03:45,847 INFO L432 stractBuchiCegarLoop]: Abstraction has 130 states and 166 transitions. [2025-03-04 16:03:45,847 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 16:03:45,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 166 transitions. [2025-03-04 16:03:45,848 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:03:45,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:03:45,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:03:45,850 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, 1] [2025-03-04 16:03:45,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:03:45,850 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-04 16:03:45,850 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-04 16:03:45,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash -495475218, now seen corresponding path program 1 times [2025-03-04 16:03:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438913505] [2025-03-04 16:03:45,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:03:45,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:45,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 16:03:45,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 16:03:45,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:45,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:03:45,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-04 16:03:45,953 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-04 16:03:45,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:03:45,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438913505] [2025-03-04 16:03:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438913505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:03:45,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:03:45,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:03:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450810394] [2025-03-04 16:03:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:03:45,954 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:03:45,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:03:45,954 INFO L85 PathProgramCache]: Analyzing trace with hash 86327, now seen corresponding path program 5 times [2025-03-04 16:03:45,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:03:45,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896646689] [2025-03-04 16:03:45,954 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:03:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:03:45,958 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:45,958 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:45,958 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:03:45,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:45,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:03:45,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:03:45,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:03:45,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:03:45,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:03:45,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:03:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:03:46,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:03:46,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:03:46,012 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. cyclomatic complexity: 46 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-04 16:03:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:03:46,043 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2025-03-04 16:03:46,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 104 transitions. [2025-03-04 16:03:46,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:03:46,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 0 states and 0 transitions. [2025-03-04 16:03:46,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:03:46,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:03:46,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:03:46,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:03:46,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:03:46,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:03:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 16:03:46,045 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:03:46,045 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-04 16:03:46,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:03:46,045 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:03:46,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:03:46,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:03:46 BoogieIcfgContainer [2025-03-04 16:03:46,052 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:03:46,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:03:46,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:03:46,053 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:03:46,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:03:20" (3/4) ... [2025-03-04 16:03:46,055 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:03:46,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:03:46,056 INFO L158 Benchmark]: Toolchain (without parser) took 25714.30ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 103.6MB in the beginning and 255.2MB in the end (delta: -151.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2025-03-04 16:03:46,056 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:03:46,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.59ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 91.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:03:46,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.44ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:03:46,057 INFO L158 Benchmark]: Boogie Preprocessor took 43.26ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 88.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:03:46,057 INFO L158 Benchmark]: IcfgBuilder took 355.96ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 70.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:03:46,057 INFO L158 Benchmark]: BuchiAutomizer took 25085.00ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 70.2MB in the beginning and 258.3MB in the end (delta: -188.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2025-03-04 16:03:46,058 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 327.2MB. Free memory was 255.3MB in the beginning and 255.2MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:03:46,059 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.59ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 91.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.44ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.26ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 88.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.96ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 70.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 25085.00ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 70.2MB in the beginning and 258.3MB in the end (delta: -188.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 327.2MB. Free memory was 255.3MB in the beginning and 255.2MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (12 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 5 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function j and consists of 5 locations. 12 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.0s and 17 iterations. TraceHistogramMax:8. Analysis of lassos took 23.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 153 StatesRemovedByMinimization, 9 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, 376 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 1390 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 926 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 625 IncrementalHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 464 mSDtfsCounter, 625 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU8 SILI0 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: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:03:46,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:46,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:46,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 16:03:46,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE