./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/string-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/string-2.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 fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:19:53,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:19:53,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:19:53,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:19:53,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:19:53,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:19:53,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:19:53,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:19:53,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:19:53,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:19:53,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:19:53,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:19:53,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:19:53,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:19:53,568 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:19:53,568 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:19:53,568 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:19:53,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:19:53,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:19:53,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:19:53,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:19:53,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:19:53,570 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:19:53,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:19:53,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:19:53,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:19:53,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:19:53,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:19:53,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:19:53,570 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:19:53,570 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 -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2025-03-17 20:19:53,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:19:53,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:19:53,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:19:53,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:19:53,785 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:19:53,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2025-03-17 20:19:54,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce1722a5/a414d7e301a847188bf961a749b907d5/FLAG6e6fb43aa [2025-03-17 20:19:55,171 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:19:55,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2025-03-17 20:19:55,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce1722a5/a414d7e301a847188bf961a749b907d5/FLAG6e6fb43aa [2025-03-17 20:19:55,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce1722a5/a414d7e301a847188bf961a749b907d5 [2025-03-17 20:19:55,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:19:55,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:19:55,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:19:55,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:19:55,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:19:55,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55, skipping insertion in model container [2025-03-17 20:19:55,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:19:55,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:19:55,640 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:19:55,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:19:55,668 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:19:55,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55 WrapperNode [2025-03-17 20:19:55,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:19:55,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:19:55,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:19:55,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:19:55,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,698 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 118 [2025-03-17 20:19:55,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:19:55,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:19:55,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:19:55,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:19:55,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,720 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-17 20:19:55,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:19:55,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:19:55,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:19:55,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:19:55,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (1/1) ... [2025-03-17 20:19:55,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:55,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:55,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 20:19:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:19:55,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 20:19:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:19:55,846 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:19:55,847 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:19:56,001 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#string_A~0#1.base, main_~#string_A~0#1.offset);havoc main_~#string_A~0#1.base, main_~#string_A~0#1.offset;call ULTIMATE.dealloc(main_~#string_B~0#1.base, main_~#string_B~0#1.offset);havoc main_~#string_B~0#1.base, main_~#string_B~0#1.offset; [2025-03-17 20:19:56,012 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 20:19:56,013 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:19:56,025 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:19:56,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:19:56,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:19:56 BoogieIcfgContainer [2025-03-17 20:19:56,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:19:56,027 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:19:56,027 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:19:56,031 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:19:56,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:19:56,031 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:19:55" (1/3) ... [2025-03-17 20:19:56,032 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@189967b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:19:56, skipping insertion in model container [2025-03-17 20:19:56,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:19:56,032 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:55" (2/3) ... [2025-03-17 20:19:56,032 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@189967b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:19:56, skipping insertion in model container [2025-03-17 20:19:56,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:19:56,032 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:19:56" (3/3) ... [2025-03-17 20:19:56,033 INFO L363 chiAutomizerObserver]: Analyzing ICFG string-2.i [2025-03-17 20:19:56,073 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:19:56,073 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:19:56,073 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:19:56,074 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:19:56,074 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:19:56,074 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:19:56,074 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:19:56,074 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:19:56,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:19:56,088 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 8 [2025-03-17 20:19:56,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:19:56,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:19:56,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:19:56,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:19:56,092 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:19:56,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:19:56,094 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 8 [2025-03-17 20:19:56,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:19:56,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:19:56,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:19:56,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:19:56,098 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" [2025-03-17 20:19:56,098 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-03-17 20:19:56,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 81, now seen corresponding path program 1 times [2025-03-17 20:19:56,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:56,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515548393] [2025-03-17 20:19:56,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:56,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:56,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:56,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:56,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:56,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:56,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:56,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:56,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:56,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:56,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:56,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 80, now seen corresponding path program 1 times [2025-03-17 20:19:56,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:56,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143009571] [2025-03-17 20:19:56,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:56,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:56,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:56,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:56,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:56,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:56,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:56,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:56,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:56,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:56,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:56,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:56,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:56,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2560, now seen corresponding path program 1 times [2025-03-17 20:19:56,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:56,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084451190] [2025-03-17 20:19:56,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:56,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:19:56,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:19:56,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:56,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:56,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:56,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:19:56,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:19:56,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:56,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:56,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:56,540 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:19:56,541 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:19:56,541 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:19:56,541 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:19:56,541 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:19:56,544 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:56,544 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:19:56,544 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:19:56,544 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration1_Lasso [2025-03-17 20:19:56,544 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:19:56,544 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:19:56,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:19:56,997 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:19:56,999 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:19:57,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:19:57,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-17 20:19:57,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:19:57,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:19:57,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-17 20:19:57,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:19:57,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:19:57,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:19:57,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:19:57,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:19:57,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:19:57,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,138 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:19:57,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:19:57,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:19:57,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,163 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 20:19:57,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:19:57,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 20:19:57,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-17 20:19:57,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,257 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-17 20:19:57,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,259 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-17 20:19:57,260 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-17 20:19:57,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,281 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-17 20:19:57,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,283 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-17 20:19:57,284 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-17 20:19:57,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,304 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-17 20:19:57,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,306 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 20:19:57,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,331 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-17 20:19:57,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,334 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 20:19:57,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,355 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-17 20:19:57,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,357 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 20:19:57,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 20:19:57,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,379 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 20:19:57,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,405 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 20:19:57,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 20:19:57,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,426 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 20:19:57,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 20:19:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,448 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 20:19:57,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:19:57,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:19:57,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:19:57,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 20:19:57,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,469 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 20:19:57,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:19:57,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:19:57,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:19:57,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 20:19:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,493 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 20:19:57,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:19:57,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:19:57,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:19:57,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:19:57,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:19:57,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:19:57,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:19:57,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:19:57,550 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 20:19:57,552 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:19:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:19:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,556 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:19:57,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:19:57,573 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:19:57,573 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:19:57,573 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 20:19:57,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 20:19:57,606 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 20:19:57,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:19:57,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:19:57,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:57,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:57,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:57,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:57,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:19:57,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:19:57,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:19:57,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:57,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:57,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:57,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:19:57,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:19:57,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:19:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:19:57,696 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:19:57,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:19:57,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 38 transitions. Complement of second has 3 states. [2025-03-17 20:19:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:19:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:19:57,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 20:19:57,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2025-03-17 20:19:57,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:19:57,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 20:19:57,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:19:57,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 20:19:57,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:19:57,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 38 transitions. [2025-03-17 20:19:57,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-17 20:19:57,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 14 states and 22 transitions. [2025-03-17 20:19:57,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-17 20:19:57,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-17 20:19:57,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 22 transitions. [2025-03-17 20:19:57,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:19:57,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 22 transitions. [2025-03-17 20:19:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 22 transitions. [2025-03-17 20:19:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 20:19:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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-17 20:19:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2025-03-17 20:19:57,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 22 transitions. [2025-03-17 20:19:57,761 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 22 transitions. [2025-03-17 20:19:57,761 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:19:57,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 22 transitions. [2025-03-17 20:19:57,762 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-17 20:19:57,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:19:57,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:19:57,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:19:57,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:19:57,763 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" [2025-03-17 20:19:57,763 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-17 20:19:57,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash 79376, now seen corresponding path program 1 times [2025-03-17 20:19:57,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:57,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789838571] [2025-03-17 20:19:57,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:57,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:57,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:19:57,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:19:57,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:57,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:19:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:19:57,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:19:57,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789838571] [2025-03-17 20:19:57,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789838571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:19:57,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:19:57,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:19:57,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802574895] [2025-03-17 20:19:57,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:19:57,839 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:19:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2025-03-17 20:19:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:57,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349908879] [2025-03-17 20:19:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:57,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:57,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:57,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:57,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:57,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:57,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:57,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:57,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:57,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:57,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:19:57,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:19:57,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:19:57,911 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:19:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:19:57,932 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2025-03-17 20:19:57,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2025-03-17 20:19:57,933 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-17 20:19:57,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2025-03-17 20:19:57,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-17 20:19:57,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-17 20:19:57,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2025-03-17 20:19:57,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:19:57,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-17 20:19:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2025-03-17 20:19:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-03-17 20:19:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:19:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-17 20:19:57,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-17 20:19:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:19:57,938 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-17 20:19:57,938 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:19:57,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2025-03-17 20:19:57,938 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-17 20:19:57,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:19:57,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:19:57,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:19:57,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:19:57,939 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-17 20:19:57,939 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-17 20:19:57,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash 76312587, now seen corresponding path program 1 times [2025-03-17 20:19:57,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:57,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032517408] [2025-03-17 20:19:57,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:57,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:19:57,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:19:57,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:57,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:19:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:19:57,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:19:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032517408] [2025-03-17 20:19:57,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032517408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:19:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911383377] [2025-03-17 20:19:57,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:57,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:19:57,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:57,998 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:19:57,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 20:19:58,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:19:58,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:19:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:19:58,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 20:19:58,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:19:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:19:58,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:19:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:19:58,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911383377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:19:58,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:19:58,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 20:19:58,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002990986] [2025-03-17 20:19:58,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:19:58,100 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:19:58,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2025-03-17 20:19:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876806395] [2025-03-17 20:19:58,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:19:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:58,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:58,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:19:58,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:58,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:58,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 20:19:58,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:58,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:58,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:19:58,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:19:58,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:19:58,160 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-17 20:19:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:19:58,202 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-17 20:19:58,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2025-03-17 20:19:58,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-17 20:19:58,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2025-03-17 20:19:58,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 20:19:58,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:19:58,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2025-03-17 20:19:58,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:19:58,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-03-17 20:19:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2025-03-17 20:19:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2025-03-17 20:19:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:19:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-17 20:19:58,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 20:19:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:19:58,207 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 20:19:58,207 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:19:58,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2025-03-17 20:19:58,207 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-17 20:19:58,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:19:58,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:19:58,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2025-03-17 20:19:58,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:19:58,207 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-17 20:19:58,207 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-17 20:19:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1774056368, now seen corresponding path program 2 times [2025-03-17 20:19:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372238503] [2025-03-17 20:19:58,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:19:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 20:19:58,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:19:58,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:19:58,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:19:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:19:58,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:19:58,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372238503] [2025-03-17 20:19:58,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372238503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:19:58,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935505253] [2025-03-17 20:19:58,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:19:58,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:19:58,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:19:58,340 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:19:58,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 20:19:58,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 20:19:58,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:19:58,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:19:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:19:58,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:19:58,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:19:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:19:58,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:19:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:19:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935505253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:19:58,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:19:58,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-17 20:19:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905988140] [2025-03-17 20:19:58,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:19:58,442 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:19:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2025-03-17 20:19:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106405340] [2025-03-17 20:19:58,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:19:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:58,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:58,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:19:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:58,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:58,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:58,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:58,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:19:58,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 20:19:58,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 20:19:58,487 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 1.25) 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-17 20:19:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:19:58,527 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-03-17 20:19:58,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2025-03-17 20:19:58,528 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-17 20:19:58,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2025-03-17 20:19:58,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-17 20:19:58,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-17 20:19:58,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2025-03-17 20:19:58,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:19:58,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-17 20:19:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2025-03-17 20:19:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2025-03-17 20:19:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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-17 20:19:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-17 20:19:58,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-17 20:19:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:19:58,534 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-17 20:19:58,535 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:19:58,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2025-03-17 20:19:58,536 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-17 20:19:58,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:19:58,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:19:58,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2025-03-17 20:19:58,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:19:58,538 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-17 20:19:58,538 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-17 20:19:58,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1287659317, now seen corresponding path program 3 times [2025-03-17 20:19:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886856673] [2025-03-17 20:19:58,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:19:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-03-17 20:19:58,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:19:58,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 20:19:58,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:58,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:19:58,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:19:58,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:58,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 4 times [2025-03-17 20:19:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340769266] [2025-03-17 20:19:58,591 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:19:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,594 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-17 20:19:58,597 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:58,597 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:19:58,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:58,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:19:58,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:19:58,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:58,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1262733121, now seen corresponding path program 4 times [2025-03-17 20:19:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817758281] [2025-03-17 20:19:58,605 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:19:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,615 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-03-17 20:19:58,625 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-03-17 20:19:58,626 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 20:19:58,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:19:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 20:19:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:19:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817758281] [2025-03-17 20:19:58,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817758281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:19:58,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:19:58,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 20:19:58,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881232777] [2025-03-17 20:19:58,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:19:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:19:58,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 20:19:58,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 20:19:58,750 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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-17 20:19:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:19:58,815 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-03-17 20:19:58,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2025-03-17 20:19:58,816 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-17 20:19:58,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2025-03-17 20:19:58,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-03-17 20:19:58,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-03-17 20:19:58,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2025-03-17 20:19:58,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:19:58,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-17 20:19:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2025-03-17 20:19:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2025-03-17 20:19:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:19:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-17 20:19:58,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-17 20:19:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 20:19:58,821 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-17 20:19:58,821 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:19:58,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2025-03-17 20:19:58,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-17 20:19:58,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:19:58,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:19:58,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2025-03-17 20:19:58,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:19:58,822 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" [2025-03-17 20:19:58,822 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" [2025-03-17 20:19:58,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -490021078, now seen corresponding path program 1 times [2025-03-17 20:19:58,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4296161] [2025-03-17 20:19:58,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:19:58,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:19:58,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:58,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:19:58,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:19:58,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:58,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 1 times [2025-03-17 20:19:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348234806] [2025-03-17 20:19:58,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:58,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:19:58,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:19:58,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:58,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:19:58,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:19:58,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:19:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:19:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1536147689, now seen corresponding path program 1 times [2025-03-17 20:19:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:19:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-17 20:19:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:19:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:19:58,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:19:58,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:19:58,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:19:58,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:19:58,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:19:58,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:19:58,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:19:58,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:01,745 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:01,745 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:01,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:01,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:01,746 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:01,746 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:01,746 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:01,746 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:01,746 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration6_Lasso [2025-03-17 20:20:01,746 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:01,746 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:01,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:01,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:02,236 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:02,237 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:02,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,239 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:20:02,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:02,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,262 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:20:02,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-17 20:20:02,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 20:20:02,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,285 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 20:20:02,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 20:20:02,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,309 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 20:20:02,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:20:02,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,331 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 20:20:02,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,352 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-17 20:20:02,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,354 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 20:20:02,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,372 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-17 20:20:02,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,374 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 20:20:02,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:20:02,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,401 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 20:20:02,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:02,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,436 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 20:20:02,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-17 20:20:02,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:20:02,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,462 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 20:20:02,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:02,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,483 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 20:20:02,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 20:20:02,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,505 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 20:20:02,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 20:20:02,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,530 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 20:20:02,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:02,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,552 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-17 20:20:02,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:02,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,580 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 20:20:02,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-17 20:20:02,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,602 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 20:20:02,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,622 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-17 20:20:02,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,624 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 20:20:02,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-17 20:20:02,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,645 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 20:20:02,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,663 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-17 20:20:02,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,664 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 20:20:02,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 20:20:02,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,687 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 20:20:02,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:02,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,712 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 20:20:02,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 20:20:02,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,732 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 20:20:02,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:02,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:02,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:02,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 20:20:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,752 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 20:20:02,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-17 20:20:02,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,775 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 20:20:02,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 20:20:02,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,799 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 20:20:02,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:02,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,822 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-17 20:20:02,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-17 20:20:02,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,845 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 20:20:02,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,856 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:20:02,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,858 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-17 20:20:02,858 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 20:20:02,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:02,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 20:20:02,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,875 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-17 20:20:02,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:02,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:02,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:02,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:02,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:02,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:02,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:02,893 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:02,906 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-17 20:20:02,906 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:20:02,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:02,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:02,908 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:02,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 20:20:02,909 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:02,919 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 20:20:02,920 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:02,920 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_2, ULTIMATE.start_main_~nc_A~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_2 - 1*ULTIMATE.start_main_~nc_A~0#1 Supporting invariants [1*ULTIMATE.start_main_~#string_A~0#1.offset >= 0] [2025-03-17 20:20:02,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 20:20:02,945 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 20:20:02,946 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:20:02,946 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:20:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:02,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:20:02,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:20:02,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:02,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:02,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 20:20:02,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:03,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:03,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:03,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:03,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:03,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:03,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:03,098 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 20:20:03,098 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:03,132 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 31 states and 38 transitions. Complement of second has 5 states. [2025-03-17 20:20:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-03-17 20:20:03,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 2 letters. [2025-03-17 20:20:03,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:03,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-17 20:20:03,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:03,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2025-03-17 20:20:03,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:03,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2025-03-17 20:20:03,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:20:03,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 29 transitions. [2025-03-17 20:20:03,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:20:03,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 20:20:03,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2025-03-17 20:20:03,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:03,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-17 20:20:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2025-03-17 20:20:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 20:20:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-17 20:20:03,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-17 20:20:03,137 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-17 20:20:03,137 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:20:03,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2025-03-17 20:20:03,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:20:03,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:03,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:03,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:03,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:03,138 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" [2025-03-17 20:20:03,138 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" [2025-03-17 20:20:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 375938101, now seen corresponding path program 1 times [2025-03-17 20:20:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:03,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286191650] [2025-03-17 20:20:03,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:03,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:20:03,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:20:03,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:03,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:03,161 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:03,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:20:03,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:20:03,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:03,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:03,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:03,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 1 times [2025-03-17 20:20:03,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:03,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746566637] [2025-03-17 20:20:03,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:03,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:03,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:03,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:03,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:03,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:03,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:03,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:03,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:03,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:03,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:03,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:03,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 499263060, now seen corresponding path program 1 times [2025-03-17 20:20:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:03,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937995579] [2025-03-17 20:20:03,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:03,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:20:03,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:20:03,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:03,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:03,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:03,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:20:03,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:20:03,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:03,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:03,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:03,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 20:20:06,554 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:06,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:06,555 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:06,555 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:06,555 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:06,555 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:06,555 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:06,555 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:06,555 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration7_Lasso [2025-03-17 20:20:06,555 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:06,555 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:06,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:06,978 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:06,978 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:06,983 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:06,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 20:20:06,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:06,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:06,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:06,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:06,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:06,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:06,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:06,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:06,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 20:20:07,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,003 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 20:20:07,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-17 20:20:07,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-17 20:20:07,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,024 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 20:20:07,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 20:20:07,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,045 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 20:20:07,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 20:20:07,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,068 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 20:20:07,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-17 20:20:07,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,087 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 20:20:07,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 20:20:07,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,108 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 20:20:07,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-17 20:20:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,128 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-17 20:20:07,128 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-17 20:20:07,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,146 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-17 20:20:07,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,148 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-17 20:20:07,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,167 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-17 20:20:07,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,169 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 20:20:07,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-17 20:20:07,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,189 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 20:20:07,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 20:20:07,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,209 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,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-17 20:20:07,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 20:20:07,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 20:20:07,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,235 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 20:20:07,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-17 20:20:07,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,257 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 20:20:07,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-17 20:20:07,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,285 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 20:20:07,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 20:20:07,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,306 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 20:20:07,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:07,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,326 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 20:20:07,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,345 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-17 20:20:07,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,347 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 20:20:07,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:07,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,371 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 20:20:07,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,396 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-17 20:20:07,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,398 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-17 20:20:07,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,416 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-17 20:20:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,418 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 20:20:07,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:07,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:07,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:07,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 20:20:07,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,440 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-17 20:20:07,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-17 20:20:07,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,463 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-17 20:20:07,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,485 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-17 20:20:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,487 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-17 20:20:07,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-17 20:20:07,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,510 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-17 20:20:07,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-17 20:20:07,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,535 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:07,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-17 20:20:07,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,559 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-17 20:20:07,560 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-17 20:20:07,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:07,581 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-17 20:20:07,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,583 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-17 20:20:07,584 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-17 20:20:07,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:07,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:07,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:07,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:07,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:07,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:07,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:07,607 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:07,622 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:20:07,622 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-17 20:20:07,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:07,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:07,623 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-17 20:20:07,624 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-17 20:20:07,625 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:07,636 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 20:20:07,637 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:07,637 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0#1.offset, ULTIMATE.start_main_~nc_B~0#1) = -2*ULTIMATE.start_main_~#string_B~0#1.offset - 2*ULTIMATE.start_main_~nc_B~0#1 + 9 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_3 + 5 >= 0] [2025-03-17 20:20:07,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:07,662 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 20:20:07,665 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#string_B~0!offset [2025-03-17 20:20:07,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:07,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:20:07,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:20:07,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:07,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:07,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:20:07,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:07,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 20:20:07,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:07,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:07,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:07,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:07,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:07,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:07,847 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 20:20:07,847 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:07,887 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 5 states. [2025-03-17 20:20:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-03-17 20:20:07,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 18 letters. Loop has 2 letters. [2025-03-17 20:20:07,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:07,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 20 letters. Loop has 2 letters. [2025-03-17 20:20:07,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:07,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 18 letters. Loop has 4 letters. [2025-03-17 20:20:07,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:07,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2025-03-17 20:20:07,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:07,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 32 transitions. [2025-03-17 20:20:07,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:20:07,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 20:20:07,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2025-03-17 20:20:07,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:07,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-17 20:20:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2025-03-17 20:20:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 20:20:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-17 20:20:07,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-17 20:20:07,890 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-17 20:20:07,890 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:20:07,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2025-03-17 20:20:07,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:07,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:07,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:07,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:07,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:07,891 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-17 20:20:07,892 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:07,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1702714333, now seen corresponding path program 1 times [2025-03-17 20:20:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:07,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989028493] [2025-03-17 20:20:07,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:07,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 20:20:07,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:20:07,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:07,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:07,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 20:20:07,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:20:07,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:07,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:07,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 1 times [2025-03-17 20:20:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:07,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646033005] [2025-03-17 20:20:07,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:07,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:07,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:07,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:07,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:07,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:07,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:07,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:07,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:07,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:07,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash 74066273, now seen corresponding path program 1 times [2025-03-17 20:20:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:07,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496539883] [2025-03-17 20:20:07,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:07,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:20:07,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:20:07,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:07,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:08,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:08,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496539883] [2025-03-17 20:20:08,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496539883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:08,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:08,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:20:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235400272] [2025-03-17 20:20:08,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:08,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:20:08,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:20:08,085 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:08,102 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-03-17 20:20:08,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2025-03-17 20:20:08,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:08,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 32 transitions. [2025-03-17 20:20:08,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-17 20:20:08,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 20:20:08,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2025-03-17 20:20:08,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:08,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-17 20:20:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2025-03-17 20:20:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-17 20:20:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-17 20:20:08,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-17 20:20:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:20:08,106 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-17 20:20:08,106 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:20:08,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2025-03-17 20:20:08,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:08,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:08,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:08,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:08,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:08,107 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-17 20:20:08,107 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:08,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1109457570, now seen corresponding path program 1 times [2025-03-17 20:20:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:08,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982606795] [2025-03-17 20:20:08,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:08,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:08,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:20:08,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:20:08,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:08,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982606795] [2025-03-17 20:20:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982606795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64905397] [2025-03-17 20:20:08,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:08,184 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:08,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-03-17 20:20:08,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:20:08,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:20:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:08,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 20:20:08,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:08,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 20:20:08,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64905397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:08,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 20:20:08,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 20:20:08,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423663824] [2025-03-17 20:20:08,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:08,280 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 2 times [2025-03-17 20:20:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531262917] [2025-03-17 20:20:08,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:08,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:08,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:08,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:08,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:08,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:08,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:08,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:08,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:08,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:08,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:08,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:20:08,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:08,346 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:08,364 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-17 20:20:08,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2025-03-17 20:20:08,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:08,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 32 transitions. [2025-03-17 20:20:08,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-17 20:20:08,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 20:20:08,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2025-03-17 20:20:08,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:08,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-17 20:20:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2025-03-17 20:20:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-17 20:20:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-17 20:20:08,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-17 20:20:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:20:08,369 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-17 20:20:08,370 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:20:08,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2025-03-17 20:20:08,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:08,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:08,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:08,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:08,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:08,370 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-17 20:20:08,370 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:08,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1036870755, now seen corresponding path program 1 times [2025-03-17 20:20:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:08,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355533672] [2025-03-17 20:20:08,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:08,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:20:08,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:20:08,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:08,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:08,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:08,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:20:08,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:20:08,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:08,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:08,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:08,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 3 times [2025-03-17 20:20:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:08,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763365240] [2025-03-17 20:20:08,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:08,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:08,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:08,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:08,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:08,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:08,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:08,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 383393, now seen corresponding path program 1 times [2025-03-17 20:20:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036604603] [2025-03-17 20:20:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:08,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:20:08,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:08,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:08,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:08,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:08,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:20:08,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:08,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:08,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:08,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:11,892 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:11,893 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:11,893 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:11,893 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:11,893 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:11,893 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:11,893 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:11,893 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:11,893 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration10_Lasso [2025-03-17 20:20:11,893 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:11,893 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:11,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:11,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:11,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:11,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:11,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:12,504 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:12,504 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:12,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:12,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:12,506 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-17 20:20:12,508 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-17 20:20:12,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:12,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:12,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:12,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:12,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:12,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:12,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:12,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:12,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:12,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:12,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:12,528 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-17 20:20:12,529 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-17 20:20:12,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:12,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:12,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:12,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:12,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:12,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:12,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:12,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:12,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:12,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-17 20:20:12,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:12,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:12,551 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-17 20:20:12,553 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-17 20:20:12,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:12,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:12,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:12,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:12,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:12,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:12,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:12,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:12,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:12,572 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-17 20:20:12,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:12,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:12,574 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-17 20:20:12,575 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-17 20:20:12,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:12,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:12,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:12,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:12,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:12,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:12,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:12,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:12,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:12,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-17 20:20:12,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:12,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:12,595 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-17 20:20:12,596 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-17 20:20:12,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:12,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:12,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:12,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:12,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:12,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:12,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:12,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:12,618 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-17 20:20:12,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:12,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:12,620 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-17 20:20:12,626 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-17 20:20:12,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:12,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:12,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:12,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:12,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:12,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:12,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:12,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:12,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:12,647 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-17 20:20:12,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:12,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:12,649 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-17 20:20:12,650 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-17 20:20:12,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:12,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:12,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:12,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:12,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:12,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:12,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:12,670 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:12,684 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:20:12,684 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:20:12,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:12,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:12,687 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-17 20:20:12,688 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-17 20:20:12,689 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:12,702 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:12,702 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:12,702 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~nc_A~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~nc_A~0#1 Supporting invariants [] [2025-03-17 20:20:12,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-17 20:20:12,733 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 20:20:12,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:12,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:20:12,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:20:12,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:12,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:12,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:12,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:12,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:12,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:12,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:12,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:20:12,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:12,828 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:12,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:12,841 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 36 transitions. Complement of second has 5 states. [2025-03-17 20:20:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-03-17 20:20:12,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 25 letters. Loop has 2 letters. [2025-03-17 20:20:12,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:12,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-17 20:20:12,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:12,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 25 letters. Loop has 4 letters. [2025-03-17 20:20:12,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:12,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2025-03-17 20:20:12,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:12,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2025-03-17 20:20:12,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:20:12,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:20:12,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2025-03-17 20:20:12,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:12,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-17 20:20:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2025-03-17 20:20:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 20:20:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-17 20:20:12,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-17 20:20:12,847 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-17 20:20:12,847 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:20:12,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2025-03-17 20:20:12,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:12,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:12,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:12,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:12,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:12,848 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-17 20:20:12,848 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:12,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash 383394, now seen corresponding path program 1 times [2025-03-17 20:20:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:12,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274432791] [2025-03-17 20:20:12,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:12,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:20:12,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:12,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:12,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:12,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:12,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:20:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:12,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:12,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:12,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 4 times [2025-03-17 20:20:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449234450] [2025-03-17 20:20:12,879 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:20:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:12,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:20:12,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:12,881 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:20:12,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:12,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:12,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:12,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:12,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:12,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:12,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:12,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash 368442144, now seen corresponding path program 1 times [2025-03-17 20:20:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371812980] [2025-03-17 20:20:12,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:12,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:20:12,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:20:12,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:12,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371812980] [2025-03-17 20:20:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371812980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844659475] [2025-03-17 20:20:13,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:13,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:13,053 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:13,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-03-17 20:20:13,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:13,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:20:13,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:20:13,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:13,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:13,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:13,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 20:20:13,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 20:20:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844659475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:13,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:13,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2025-03-17 20:20:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360851414] [2025-03-17 20:20:13,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:13,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 20:20:13,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:20:13,299 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:13,413 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2025-03-17 20:20:13,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 62 transitions. [2025-03-17 20:20:13,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:13,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 34 states and 39 transitions. [2025-03-17 20:20:13,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 20:20:13,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:20:13,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2025-03-17 20:20:13,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:13,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-17 20:20:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2025-03-17 20:20:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-17 20:20:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 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-17 20:20:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-17 20:20:13,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-17 20:20:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 20:20:13,417 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-17 20:20:13,417 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:20:13,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2025-03-17 20:20:13,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:13,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:13,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:13,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:13,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:13,418 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-17 20:20:13,418 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:13,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1891429151, now seen corresponding path program 2 times [2025-03-17 20:20:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-03-17 20:20:13,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:13,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 20:20:13,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:20:13,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-03-17 20:20:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350456147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742888191] [2025-03-17 20:20:13,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:13,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:13,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:13,534 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:13,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-03-17 20:20:13,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 20:20:13,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:20:13,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:13,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:13,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:20:13,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:13,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:13,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742888191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:13,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:13,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 20:20:13,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972131234] [2025-03-17 20:20:13,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:13,699 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:13,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 5 times [2025-03-17 20:20:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:13,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59341013] [2025-03-17 20:20:13,699 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:20:13,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:13,702 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:13,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:13,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:13,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:13,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:13,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:13,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:13,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:13,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:13,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:13,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 20:20:13,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 20:20:13,760 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:13,811 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-17 20:20:13,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2025-03-17 20:20:13,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:13,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 37 states and 42 transitions. [2025-03-17 20:20:13,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 20:20:13,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:20:13,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2025-03-17 20:20:13,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:13,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-17 20:20:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2025-03-17 20:20:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-17 20:20:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-17 20:20:13,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-17 20:20:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:20:13,816 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-17 20:20:13,816 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:20:13,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2025-03-17 20:20:13,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:13,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:13,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:13,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:13,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:13,817 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-17 20:20:13,817 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:13,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash -858725790, now seen corresponding path program 3 times [2025-03-17 20:20:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:13,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718883977] [2025-03-17 20:20:13,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:13,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:13,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-17 20:20:13,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 20:20:13,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 20:20:13,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:13,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:13,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 20:20:13,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 20:20:13,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:13,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:13,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:13,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 6 times [2025-03-17 20:20:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314506553] [2025-03-17 20:20:13,852 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:20:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:13,854 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:13,854 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:13,854 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:20:13,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:13,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:13,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:13,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:13,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:13,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:13,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash -601762848, now seen corresponding path program 2 times [2025-03-17 20:20:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:13,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108652447] [2025-03-17 20:20:13,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:13,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 20:20:13,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:20:13,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:13,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:13,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:13,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:20:13,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:20:13,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:13,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:13,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:17,503 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:17,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:17,503 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:17,503 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:17,503 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:17,503 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,503 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:17,504 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:17,504 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration13_Lasso [2025-03-17 20:20:17,504 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:17,504 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:17,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:18,280 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:18,280 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:18,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,283 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-17 20:20:18,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-17 20:20:18,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,304 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-17 20:20:18,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-17 20:20:18,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-17 20:20:18,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,327 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-17 20:20:18,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-17 20:20:18,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,349 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-17 20:20:18,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,370 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-17 20:20:18,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-17 20:20:18,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,390 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-17 20:20:18,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-17 20:20:18,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,410 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-17 20:20:18,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-17 20:20:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,430 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-17 20:20:18,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-17 20:20:18,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,451 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-17 20:20:18,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-17 20:20:18,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,470 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-17 20:20:18,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-17 20:20:18,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,491 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-17 20:20:18,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-03-17 20:20:18,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,514 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-17 20:20:18,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,536 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-17 20:20:18,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-17 20:20:18,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,559 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-17 20:20:18,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,582 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-17 20:20:18,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,604 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-17 20:20:18,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-17 20:20:18,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,627 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-17 20:20:18,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:18,659 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-17 20:20:18,659 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-17 20:20:18,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,661 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-17 20:20:18,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:18,673 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:18,673 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:18,673 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~nc_B~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-17 20:20:18,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-17 20:20:18,700 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:20:18,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 20:20:18,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 20:20:18,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:18,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:18,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:18,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:18,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:18,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:18,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:20:18,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:18,788 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:18,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 46 transitions. Complement of second has 5 states. [2025-03-17 20:20:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-03-17 20:20:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 31 letters. Loop has 2 letters. [2025-03-17 20:20:18,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 33 letters. Loop has 2 letters. [2025-03-17 20:20:18,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:18,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 31 letters. Loop has 4 letters. [2025-03-17 20:20:18,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:18,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2025-03-17 20:20:18,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:18,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2025-03-17 20:20:18,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:18,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 20:20:18,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2025-03-17 20:20:18,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:18,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-17 20:20:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2025-03-17 20:20:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 20:20:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 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-17 20:20:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-03-17 20:20:18,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-17 20:20:18,806 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-17 20:20:18,806 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 20:20:18,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2025-03-17 20:20:18,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:18,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:18,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:18,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:18,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:18,807 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-17 20:20:18,807 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash -601762847, now seen corresponding path program 4 times [2025-03-17 20:20:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314573877] [2025-03-17 20:20:18,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:20:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-17 20:20:18,828 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:20:18,828 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:20:18,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:18,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:20:18,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:20:18,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 7 times [2025-03-17 20:20:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361650188] [2025-03-17 20:20:18,850 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:20:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:18,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:18,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:18,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:18,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:18,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1526489503, now seen corresponding path program 3 times [2025-03-17 20:20:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-03-17 20:20:18,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-03-17 20:20:18,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 35 statements. [2025-03-17 20:20:18,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:20:18,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:18,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-03-17 20:20:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-03-17 20:20:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338344809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806204517] [2025-03-17 20:20:19,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:19,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:19,039 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:19,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-03-17 20:20:19,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-03-17 20:20:19,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 35 statements. [2025-03-17 20:20:19,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:20:19,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:19,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:20:19,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:19,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 20:20:19,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806204517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:19,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:19,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-17 20:20:19,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064164597] [2025-03-17 20:20:19,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:19,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 20:20:19,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:20:19,303 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:19,373 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-03-17 20:20:19,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 72 transitions. [2025-03-17 20:20:19,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:19,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 42 states and 49 transitions. [2025-03-17 20:20:19,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-17 20:20:19,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 20:20:19,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2025-03-17 20:20:19,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:19,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-03-17 20:20:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2025-03-17 20:20:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-17 20:20:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.170731707317073) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-03-17 20:20:19,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-17 20:20:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 20:20:19,378 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-17 20:20:19,378 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 20:20:19,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2025-03-17 20:20:19,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:19,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:19,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:19,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:19,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:19,382 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-17 20:20:19,382 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:19,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1575969760, now seen corresponding path program 5 times [2025-03-17 20:20:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074474107] [2025-03-17 20:20:19,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:20:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,392 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-03-17 20:20:19,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:20:19,413 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 20:20:19,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 20:20:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074474107] [2025-03-17 20:20:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074474107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792437677] [2025-03-17 20:20:19,527 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:20:19,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:19,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:19,529 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:19,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-03-17 20:20:19,600 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-03-17 20:20:19,660 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:20:19,660 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 20:20:19,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:19,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 20:20:19,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 20:20:19,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 20:20:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792437677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:19,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-17 20:20:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103974859] [2025-03-17 20:20:19,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:19,771 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 8 times [2025-03-17 20:20:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953977750] [2025-03-17 20:20:19,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:19,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:19,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:19,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:19,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 20:20:19,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:20:19,838 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:19,876 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-17 20:20:19,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2025-03-17 20:20:19,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:19,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 52 transitions. [2025-03-17 20:20:19,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-17 20:20:19,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 20:20:19,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 52 transitions. [2025-03-17 20:20:19,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:19,877 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-03-17 20:20:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 52 transitions. [2025-03-17 20:20:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-17 20:20:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-03-17 20:20:19,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-17 20:20:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:20:19,881 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-17 20:20:19,881 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 20:20:19,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2025-03-17 20:20:19,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:20:19,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:19,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:19,882 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:19,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:19,882 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-17 20:20:19,882 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:20:19,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,883 INFO L85 PathProgramCache]: Analyzing trace with hash 532972833, now seen corresponding path program 6 times [2025-03-17 20:20:19,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735905508] [2025-03-17 20:20:19,883 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:20:19,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,894 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-03-17 20:20:19,906 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:20:19,907 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-17 20:20:19,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:20:19,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:20:19,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:19,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 9 times [2025-03-17 20:20:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704946718] [2025-03-17 20:20:19,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:19,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:19,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:19,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:19,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:19,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:19,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:19,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1085784799, now seen corresponding path program 4 times [2025-03-17 20:20:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800624447] [2025-03-17 20:20:19,929 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:20:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-17 20:20:19,949 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:20:19,949 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:20:19,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:20:19,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:20:19,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:25,370 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 383 DAG size of output: 288 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:20:25,819 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:25,820 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:25,820 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:25,820 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:25,820 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:25,820 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:25,820 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:25,820 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:25,820 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration16_Lasso [2025-03-17 20:20:25,820 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:25,820 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:25,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:25,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:26,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:26,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:26,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:26,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:26,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:26,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:26,394 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-03-17 20:20:27,440 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:27,441 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:27,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,443 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-17 20:20:27,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-17 20:20:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,463 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-17 20:20:27,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-03-17 20:20:27,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,483 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-17 20:20:27,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-03-17 20:20:27,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,504 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-17 20:20:27,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:27,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:27,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,527 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-17 20:20:27,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:27,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-17 20:20:27,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,553 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-17 20:20:27,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-17 20:20:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,576 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-17 20:20:27,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-17 20:20:27,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,596 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-17 20:20:27,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-03-17 20:20:27,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,617 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-03-17 20:20:27,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-03-17 20:20:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,638 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-03-17 20:20:27,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-03-17 20:20:27,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,658 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-03-17 20:20:27,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-03-17 20:20:27,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,679 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-03-17 20:20:27,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:27,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:27,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:27,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-03-17 20:20:27,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,700 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-03-17 20:20:27,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:27,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-03-17 20:20:27,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,725 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-03-17 20:20:27,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,738 INFO L203 nArgumentSynthesizer]: 36 stem disjuncts [2025-03-17 20:20:27,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,772 INFO L401 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2025-03-17 20:20:27,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-03-17 20:20:27,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,832 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-17 20:20:27,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:27,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-03-17 20:20:27,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,858 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-17 20:20:27,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-17 20:20:27,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:27,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-03-17 20:20:27,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,890 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-17 20:20:27,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-17 20:20:27,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,905 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-17 20:20:27,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,907 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 20:20:27,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:27,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,924 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-03-17 20:20:27,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:27,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:27,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-03-17 20:20:27,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:27,960 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:27,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-03-17 20:20:27,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:27,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:27,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:27,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:27,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:27,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:27,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:27,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:27,995 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 20:20:27,995 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:20:27,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:27,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,000 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:28,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-03-17 20:20:28,003 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:28,016 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:28,016 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:28,016 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~nc_B~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~nc_B~0#1 Supporting invariants [] [2025-03-17 20:20:28,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-03-17 20:20:28,044 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 20:20:28,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:28,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:20:28,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:20:28,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:28,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:28,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:28,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:28,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:28,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:28,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:20:28,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:28,139 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:28,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:28,149 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 5 states. [2025-03-17 20:20:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-03-17 20:20:28,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-17 20:20:28,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:28,150 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:20:28,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:28,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:20:28,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:20:28,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:28,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:28,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:28,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:28,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:28,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:28,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:20:28,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:28,244 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:28,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:28,255 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 5 states. [2025-03-17 20:20:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-03-17 20:20:28,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-17 20:20:28,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:28,256 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:20:28,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:28,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:20:28,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:20:28,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:28,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:28,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:28,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:28,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:28,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:20:28,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:28,349 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:28,349 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:28,359 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 57 transitions. Complement of second has 4 states. [2025-03-17 20:20:28,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2025-03-17 20:20:28,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-17 20:20:28,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:28,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 39 letters. Loop has 2 letters. [2025-03-17 20:20:28,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:28,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 37 letters. Loop has 4 letters. [2025-03-17 20:20:28,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:28,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2025-03-17 20:20:28,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:20:28,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 53 transitions. [2025-03-17 20:20:28,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 20:20:28,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 20:20:28,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 53 transitions. [2025-03-17 20:20:28,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:28,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-17 20:20:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 53 transitions. [2025-03-17 20:20:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-03-17 20:20:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 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-17 20:20:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-03-17 20:20:28,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-03-17 20:20:28,364 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-03-17 20:20:28,364 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 20:20:28,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2025-03-17 20:20:28,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:20:28,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:28,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:28,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:28,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:28,365 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-17 20:20:28,365 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-17 20:20:28,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1200558493, now seen corresponding path program 2 times [2025-03-17 20:20:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345297052] [2025-03-17 20:20:28,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:28,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 20:20:28,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:20:28,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:28,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:28,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:28,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:20:28,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:20:28,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:28,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:28,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 1 times [2025-03-17 20:20:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461662507] [2025-03-17 20:20:28,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:28,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:28,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:28,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:28,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:28,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:28,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:28,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:28,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:28,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1609491362, now seen corresponding path program 7 times [2025-03-17 20:20:28,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:28,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293046752] [2025-03-17 20:20:28,401 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:20:28,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:28,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 20:20:28,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:20:28,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:28,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:28,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 20:20:28,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:20:28,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:28,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:28,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:28,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-03-17 20:20:33,704 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:33,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:33,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:33,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:33,704 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:33,704 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:33,704 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:33,704 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:33,704 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration17_Lasso [2025-03-17 20:20:33,704 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:33,704 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:33,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:33,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:34,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:34,486 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:34,486 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:34,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,488 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-03-17 20:20:34,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-03-17 20:20:34,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,508 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-03-17 20:20:34,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-03-17 20:20:34,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,529 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-17 20:20:34,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:34,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,548 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-03-17 20:20:34,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:34,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,567 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-03-17 20:20:34,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-03-17 20:20:34,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,586 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-03-17 20:20:34,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-03-17 20:20:34,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,605 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-03-17 20:20:34,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:34,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,624 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-17 20:20:34,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-17 20:20:34,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,643 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-17 20:20:34,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-03-17 20:20:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,663 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-03-17 20:20:34,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-03-17 20:20:34,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,682 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-03-17 20:20:34,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-17 20:20:34,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,702 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-03-17 20:20:34,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-03-17 20:20:34,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,721 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-03-17 20:20:34,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-17 20:20:34,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,740 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-17 20:20:34,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-17 20:20:34,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,760 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-17 20:20:34,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:34,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:34,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:34,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-03-17 20:20:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,779 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-17 20:20:34,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:34,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:34,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-17 20:20:34,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,800 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-17 20:20:34,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:34,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:34,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-17 20:20:34,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,821 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-17 20:20:34,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,832 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-17 20:20:34,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,833 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 20:20:34,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:34,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-17 20:20:34,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,843 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-17 20:20:34,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:34,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:34,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:34,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-03-17 20:20:34,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,864 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-03-17 20:20:34,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:34,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:34,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:34,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:34,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:34,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:34,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:34,889 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:34,905 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:20:34,905 INFO L444 ModelExtractionUtils]: 10 out of 28 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-17 20:20:34,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:34,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:34,907 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:34,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-03-17 20:20:34,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:34,918 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:34,919 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:34,919 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0#1, ULTIMATE.start_main_~i~0#1) = 5*ULTIMATE.start_main_~nc_B~0#1 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 20:20:34,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-03-17 20:20:34,965 INFO L156 tatePredicateManager]: 16 out of 18 supporting invariants were superfluous and have been removed [2025-03-17 20:20:34,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:34,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:20:35,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:20:35,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:35,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:35,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:20:35,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:35,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:35,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:35,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:35,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:35,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:20:35,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:35,116 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 20:20:35,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 7 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-17 20:20:35,170 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 7. 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) Result 61 states and 73 transitions. Complement of second has 10 states. [2025-03-17 20:20:35,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-17 20:20:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. 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-17 20:20:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2025-03-17 20:20:35,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 33 letters. Loop has 2 letters. [2025-03-17 20:20:35,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:35,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 35 letters. Loop has 2 letters. [2025-03-17 20:20:35,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:35,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 33 letters. Loop has 4 letters. [2025-03-17 20:20:35,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:35,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2025-03-17 20:20:35,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:20:35,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 59 states and 69 transitions. [2025-03-17 20:20:35,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-03-17 20:20:35,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-17 20:20:35,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 69 transitions. [2025-03-17 20:20:35,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:35,172 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-03-17 20:20:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 69 transitions. [2025-03-17 20:20:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2025-03-17 20:20:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-03-17 20:20:35,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-03-17 20:20:35,174 INFO L432 stractBuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-03-17 20:20:35,174 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-17 20:20:35,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 61 transitions. [2025-03-17 20:20:35,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:20:35,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:35,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:35,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:35,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:35,174 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-17 20:20:35,174 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-17 20:20:35,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash 977174114, now seen corresponding path program 3 times [2025-03-17 20:20:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:35,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227506074] [2025-03-17 20:20:35,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:35,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-03-17 20:20:35,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:20:35,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:20:35,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:35,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-03-17 20:20:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227506074] [2025-03-17 20:20:35,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227506074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158342033] [2025-03-17 20:20:35,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:35,352 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:35,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2025-03-17 20:20:35,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-03-17 20:20:35,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:20:35,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:20:35,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:35,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 20:20:35,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:35,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158342033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:35,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:35,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-17 20:20:35,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146524335] [2025-03-17 20:20:35,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:35,616 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:35,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 2 times [2025-03-17 20:20:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:35,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699541633] [2025-03-17 20:20:35,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:35,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:35,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:35,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:35,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:35,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:35,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:35,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:35,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:35,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:35,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:35,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 20:20:35,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-17 20:20:35,687 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. cyclomatic complexity: 13 Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:35,812 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2025-03-17 20:20:35,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2025-03-17 20:20:35,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:35,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 62 states and 72 transitions. [2025-03-17 20:20:35,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-17 20:20:35,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-17 20:20:35,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 72 transitions. [2025-03-17 20:20:35,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:35,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 72 transitions. [2025-03-17 20:20:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 72 transitions. [2025-03-17 20:20:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2025-03-17 20:20:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 54 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-17 20:20:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2025-03-17 20:20:35,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-03-17 20:20:35,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 20:20:35,818 INFO L432 stractBuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-03-17 20:20:35,818 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-17 20:20:35,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 63 transitions. [2025-03-17 20:20:35,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:20:35,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:35,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:35,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:35,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:20:35,819 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-17 20:20:35,819 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-17 20:20:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1645375345, now seen corresponding path program 2 times [2025-03-17 20:20:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:35,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268270914] [2025-03-17 20:20:35,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:35,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:35,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 20:20:35,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:20:35,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:35,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:35,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:35,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 20:20:35,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:20:35,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:35,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:35,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:35,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1442, now seen corresponding path program 3 times [2025-03-17 20:20:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017334542] [2025-03-17 20:20:35,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:35,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:35,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:35,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:35,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:35,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:35,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:35,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:35,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:35,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:35,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:35,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash -657741136, now seen corresponding path program 5 times [2025-03-17 20:20:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:35,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399166456] [2025-03-17 20:20:35,857 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:20:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:35,866 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-17 20:20:35,875 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:20:35,876 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 20:20:35,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:35,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 20:20:35,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:20:35,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:35,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:35,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:41,746 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 374 DAG size of output: 278 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:20:42,032 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:42,032 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:42,032 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:42,032 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:42,032 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:42,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:42,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:42,033 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration19_Lasso [2025-03-17 20:20:42,033 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:42,033 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:42,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:42,709 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:42,709 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:42,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:42,711 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:42,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-03-17 20:20:42,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:42,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:42,723 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-17 20:20:42,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:42,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:42,724 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 20:20:42,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:42,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:42,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-03-17 20:20:42,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:42,734 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:42,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-03-17 20:20:42,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:42,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:42,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:42,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:42,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:42,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:42,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:42,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:42,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-03-17 20:20:42,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:42,756 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:42,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-03-17 20:20:42,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:42,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:42,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:42,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:42,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:42,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:42,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:42,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:42,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-03-17 20:20:42,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:42,780 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:42,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-03-17 20:20:42,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:42,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:42,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:42,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:42,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:42,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:42,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:42,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:42,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-03-17 20:20:42,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:42,804 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:42,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-03-17 20:20:42,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:42,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:42,816 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-17 20:20:42,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:42,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:42,817 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 20:20:42,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:42,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:42,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:42,827 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:42,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-03-17 20:20:42,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:42,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:42,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:42,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:42,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:42,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:42,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:42,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:42,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-03-17 20:20:42,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:42,852 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:42,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-03-17 20:20:42,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:42,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:42,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:42,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:42,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:42,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:42,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:42,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:42,884 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-17 20:20:42,884 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-17 20:20:42,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:42,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:42,886 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:42,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-03-17 20:20:42,888 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:42,898 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:42,898 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:42,899 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~nc_A~0#1 + 1*ULTIMATE.start_main_~j~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 20:20:42,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-03-17 20:20:42,928 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:20:42,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:42,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 20:20:42,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:20:42,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:42,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:42,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:42,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:42,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:43,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:43,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:43,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:43,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 20:20:43,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:43,009 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:43,009 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 63 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:43,023 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 63 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 84 transitions. Complement of second has 6 states. [2025-03-17 20:20:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-17 20:20:43,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 36 letters. Loop has 2 letters. [2025-03-17 20:20:43,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:43,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-17 20:20:43,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:43,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 36 letters. Loop has 4 letters. [2025-03-17 20:20:43,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:43,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 84 transitions. [2025-03-17 20:20:43,025 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:20:43,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 0 states and 0 transitions. [2025-03-17 20:20:43,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:20:43,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:20:43,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:20:43,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:43,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:43,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:43,025 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:43,025 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-17 20:20:43,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:20:43,025 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:20:43,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:20:43,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:20:43 BoogieIcfgContainer [2025-03-17 20:20:43,030 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:20:43,031 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:20:43,031 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:20:43,031 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:20:43,031 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:19:56" (3/4) ... [2025-03-17 20:20:43,034 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:20:43,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:20:43,035 INFO L158 Benchmark]: Toolchain (without parser) took 47542.77ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 129.2MB in the beginning and 170.8MB in the end (delta: -41.6MB). Peak memory consumption was 138.7MB. Max. memory is 16.1GB. [2025-03-17 20:20:43,035 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:43,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.14ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 117.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:20:43,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.62ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 116.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:43,036 INFO L158 Benchmark]: Boogie Preprocessor took 38.95ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 114.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:20:43,037 INFO L158 Benchmark]: IcfgBuilder took 285.85ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 99.4MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:20:43,037 INFO L158 Benchmark]: BuchiAutomizer took 47003.72ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 99.4MB in the beginning and 170.9MB in the end (delta: -71.6MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2025-03-17 20:20:43,038 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 352.3MB. Free memory was 170.9MB in the beginning and 170.8MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:43,040 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.14ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 117.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.62ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 116.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.95ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 114.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 285.85ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 99.4MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 47003.72ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 99.4MB in the beginning and 170.9MB in the end (delta: -71.6MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 352.3MB. Free memory was 170.9MB in the beginning and 170.8MB in the end (delta: 106.2kB). 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: ~#string_B~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (11 trivial, 7 deterministic, 1 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 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (((long long) -1 * i) + nc_A) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * j) + nc_B) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * i) + ((long long) 5 * nc_B)) and consists of 8 locations. One deterministic module has affine ranking function ((((long long) -1 * i) + j) + nc_A) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -1 * j) + nc_B) and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.9s and 20 iterations. TraceHistogramMax:5. Analysis of lassos took 44.8s. Construction of modules took 0.4s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 62 StatesRemovedByMinimization, 13 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 [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 705 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 834 IncrementalHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 276 mSDtfsCounter, 834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU7 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital308 mio100 ax100 hnf100 lsp94 ukn51 mio100 lsp27 div100 bol100 ite100 ukn100 eq175 hnf91 smp100 dnf580 smp89 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 98ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 36 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 76 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 20:20:43,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:43,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:43,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2025-03-17 20:20:43,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:43,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:44,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2025-03-17 20:20:44,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:44,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-17 20:20:44,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 20:20:44,866 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