./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strstr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-dietlibc/strstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:55:13,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:55:13,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:55:13,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:55:13,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:55:13,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:55:13,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:55:13,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:55:13,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:55:13,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:55:13,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:55:13,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:55:13,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:55:13,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:55:13,425 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:55:13,425 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:55:13,425 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:55:13,425 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:55:13,425 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:55:13,425 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:55:13,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:55:13,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:55:13,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:55:13,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:55:13,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:55:13,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:55:13,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:55:13,427 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:55:13,427 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc [2025-03-17 19:55:13,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:55:13,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:55:13,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:55:13,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:55:13,653 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:55:13,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strstr.i [2025-03-17 19:55:14,791 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b33780a/1774790cd97f42d68b1615b599d8935e/FLAGe1b523734 [2025-03-17 19:55:15,073 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:55:15,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2025-03-17 19:55:15,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b33780a/1774790cd97f42d68b1615b599d8935e/FLAGe1b523734 [2025-03-17 19:55:15,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b33780a/1774790cd97f42d68b1615b599d8935e [2025-03-17 19:55:15,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:55:15,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:55:15,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:55:15,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:55:15,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:55:15,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad73c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15, skipping insertion in model container [2025-03-17 19:55:15,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:55:15,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:55:15,318 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:55:15,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:55:15,379 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:55:15,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15 WrapperNode [2025-03-17 19:55:15,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:55:15,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:55:15,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:55:15,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:55:15,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,416 INFO L138 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 169 [2025-03-17 19:55:15,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:55:15,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:55:15,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:55:15,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:55:15,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,434 INFO L175 MemorySlicer]: Split 10 memory accesses to 1 slices as follows [10]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-03-17 19:55:15,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:55:15,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:55:15,443 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:55:15,443 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:55:15,443 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (1/1) ... [2025-03-17 19:55:15,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:15,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:15,467 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 19:55:15,470 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 19:55:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:55:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:55:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:55:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:55:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:55:15,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:55:15,547 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:55:15,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:55:15,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_#t~ret27#1.base, main_#t~ret27#1.offset;call ULTIMATE.dealloc(main_#t~malloc20#1.base, main_#t~malloc20#1.offset);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call ULTIMATE.dealloc(main_#t~malloc24#1.base, main_#t~malloc24#1.offset);havoc main_#t~malloc24#1.base, main_#t~malloc24#1.offset; [2025-03-17 19:55:15,745 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-03-17 19:55:15,745 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:55:15,753 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:55:15,754 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:55:15,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:55:15 BoogieIcfgContainer [2025-03-17 19:55:15,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:55:15,756 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:55:15,756 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:55:15,759 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:55:15,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:15,760 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:55:15" (1/3) ... [2025-03-17 19:55:15,762 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745a9ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:55:15, skipping insertion in model container [2025-03-17 19:55:15,762 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:15,762 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:15" (2/3) ... [2025-03-17 19:55:15,763 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745a9ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:55:15, skipping insertion in model container [2025-03-17 19:55:15,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:15,763 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:55:15" (3/3) ... [2025-03-17 19:55:15,763 INFO L363 chiAutomizerObserver]: Analyzing ICFG strstr.i [2025-03-17 19:55:15,796 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:55:15,797 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:55:15,797 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:55:15,797 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:55:15,797 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:55:15,797 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:55:15,797 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:55:15,797 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:55:15,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 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 19:55:15,811 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-03-17 19:55:15,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:15,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:15,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:55:15,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:55:15,815 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:55:15,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 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 19:55:15,819 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-03-17 19:55:15,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:15,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:15,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:55:15,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:55:15,822 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" [2025-03-17 19:55:15,822 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" [2025-03-17 19:55:15,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash 3488, now seen corresponding path program 1 times [2025-03-17 19:55:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:15,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596190329] [2025-03-17 19:55:15,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:15,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:15,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:15,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:15,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:15,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:15,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:15,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:15,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:15,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2025-03-17 19:55:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:15,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915642727] [2025-03-17 19:55:15,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:15,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:15,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:15,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:15,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:15,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:15,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:15,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:15,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:15,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:15,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 108201, now seen corresponding path program 1 times [2025-03-17 19:55:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:15,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414191172] [2025-03-17 19:55:15,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:15,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:15,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:15,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:15,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:15,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:15,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:15,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:16,177 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:16,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:16,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:16,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:16,178 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:16,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:16,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:16,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:16,178 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2025-03-17 19:55:16,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:16,178 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:16,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:16,523 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:16,525 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:16,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:16,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:16,529 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 19:55:16,530 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 19:55:16,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 19:55:16,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:16,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:16,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:16,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:16,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:16,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:16,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:16,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:16,553 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 19:55:16,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:16,555 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 19:55:16,556 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 19:55:16,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:16,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:16,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:16,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:16,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:16,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:16,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:16,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:16,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:16,576 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 19:55:16,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:16,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:16,579 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 19:55:16,580 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 19:55:16,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:16,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:16,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:16,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:16,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:16,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:16,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:16,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:16,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:16,599 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 19:55:16,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:16,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:16,601 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 19:55:16,602 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 19:55:16,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:16,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:16,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:16,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:16,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:16,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:16,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:16,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:16,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:16,623 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 19:55:16,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:16,625 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 19:55:16,626 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 19:55:16,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:16,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:16,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:16,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:16,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:16,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:16,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:16,674 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:16,694 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 19:55:16,696 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 19:55:16,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:16,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:16,699 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 19:55:16,700 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 19:55:16,701 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:16,712 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:16,712 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:16,713 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_~in_len~0#1) = -1*ULTIMATE.start_main_~i~2#1 + 1*ULTIMATE.start_main_~in_len~0#1 Supporting invariants [] [2025-03-17 19:55:16,719 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 19:55:16,729 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-17 19:55:16,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:16,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:16,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:16,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:16,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:16,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:16,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:16,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:16,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:16,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:16,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:16,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:55:16,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:16,774 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 19:55:16,791 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 19:55:16,792 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:16,812 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 51 transitions. Complement of second has 3 states. [2025-03-17 19:55:16,813 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 19:55:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-03-17 19:55:16,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 19:55:16,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:16,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-17 19:55:16,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:16,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-17 19:55:16,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:16,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. [2025-03-17 19:55:16,824 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-03-17 19:55:16,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 26 states and 39 transitions. [2025-03-17 19:55:16,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 19:55:16,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 19:55:16,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. [2025-03-17 19:55:16,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:16,828 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 39 transitions. [2025-03-17 19:55:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. [2025-03-17 19:55:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 19:55:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5) internal successors, (39), 25 states have internal predecessors, (39), 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 19:55:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2025-03-17 19:55:16,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 39 transitions. [2025-03-17 19:55:16,844 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2025-03-17 19:55:16,844 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:55:16,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 39 transitions. [2025-03-17 19:55:16,844 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-03-17 19:55:16,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:16,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:16,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:55:16,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:55:16,847 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" [2025-03-17 19:55:16,847 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" [2025-03-17 19:55:16,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 3354271, now seen corresponding path program 1 times [2025-03-17 19:55:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678954748] [2025-03-17 19:55:16,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:16,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:55:16,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:55:16,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:16,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:16,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:16,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:55:16,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:55:16,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:16,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:16,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash 97, now seen corresponding path program 1 times [2025-03-17 19:55:16,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:16,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716984294] [2025-03-17 19:55:16,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:16,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:16,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:16,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:16,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:16,903 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:16,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:16,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:16,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:16,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:16,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 103982467, now seen corresponding path program 1 times [2025-03-17 19:55:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354383863] [2025-03-17 19:55:16,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:16,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:55:16,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:55:16,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:16,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:16,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:16,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:55:16,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:55:16,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:16,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:16,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:17,228 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:17,228 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:17,228 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:17,229 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:17,229 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:17,229 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,229 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:17,229 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:17,229 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration2_Lasso [2025-03-17 19:55:17,229 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:17,229 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:17,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,625 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 19:55:17,628 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:17,628 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:17,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,630 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 19:55:17,631 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 19:55:17,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,651 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 19:55:17,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,653 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 19:55:17,654 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 19:55:17,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:17,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:55:17,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,674 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 19:55:17,676 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 19:55:17,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:17,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,695 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 19:55:17,696 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 19:55:17,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,713 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 19:55:17,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,715 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 19:55:17,716 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 19:55:17,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,733 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 19:55:17,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,735 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 19:55:17,736 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 19:55:17,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,754 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 19:55:17,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,756 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 19:55:17,758 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 19:55:17,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 19:55:17,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:55:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,775 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 19:55:17,776 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 19:55:17,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 19:55:17,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,792 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 19:55:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,794 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 19:55:17,796 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 19:55:17,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:17,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:17,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:17,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:55:17,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,822 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 19:55:17,823 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 19:55:17,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:17,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:17,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,845 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 19:55:17,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,847 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 19:55:17,849 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 19:55:17,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:17,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:17,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:17,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,872 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 19:55:17,874 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 19:55:17,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:17,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:17,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:17,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:17,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:17,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:17,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:17,895 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:17,906 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 19:55:17,906 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-17 19:55:17,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:17,908 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 19:55:17,909 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 19:55:17,909 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:17,919 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:17,920 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:17,920 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~out_len~0#1, ULTIMATE.start_main_~i~3#1) = 1*ULTIMATE.start_main_~out_len~0#1 - 1*ULTIMATE.start_main_~i~3#1 Supporting invariants [] [2025-03-17 19:55:17,926 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 19:55:17,940 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 19:55:17,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:17,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:55:17,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:55:17,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:17,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:17,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:17,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:17,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:17,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:17,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:17,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:17,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:55:17,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:17,970 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 19:55:17,970 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 19:55:17,970 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 39 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 19:55:17,982 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 39 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 27 states and 41 transitions. Complement of second has 3 states. [2025-03-17 19:55:17,982 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 19:55:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 19:55:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-03-17 19:55:17,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 19:55:17,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:17,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-17 19:55:17,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:17,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 19:55:17,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:17,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2025-03-17 19:55:17,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 19:55:17,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2025-03-17 19:55:17,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 19:55:17,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 19:55:17,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2025-03-17 19:55:17,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:17,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 41 transitions. [2025-03-17 19:55:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2025-03-17 19:55:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 19:55:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 26 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 19:55:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2025-03-17 19:55:17,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 41 transitions. [2025-03-17 19:55:17,986 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2025-03-17 19:55:17,986 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:55:17,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 41 transitions. [2025-03-17 19:55:17,986 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 19:55:17,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:17,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:17,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:55:17,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:55:17,987 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" [2025-03-17 19:55:17,987 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" [2025-03-17 19:55:17,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1071510786, now seen corresponding path program 1 times [2025-03-17 19:55:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348514745] [2025-03-17 19:55:17,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:17,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:18,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:18,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:18,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:18,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:18,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:18,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2816, now seen corresponding path program 1 times [2025-03-17 19:55:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046862330] [2025-03-17 19:55:18,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:18,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:18,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:18,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:18,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:18,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:18,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:18,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1070287549, now seen corresponding path program 1 times [2025-03-17 19:55:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378517363] [2025-03-17 19:55:18,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:18,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:55:18,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:55:18,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:18,269 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 19:55:18,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:18,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378517363] [2025-03-17 19:55:18,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378517363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:18,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:18,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:55:18,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875128203] [2025-03-17 19:55:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:18,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:55:18,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:55:18,306 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:18,345 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-03-17 19:55:18,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2025-03-17 19:55:18,346 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 19:55:18,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 44 transitions. [2025-03-17 19:55:18,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-03-17 19:55:18,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-03-17 19:55:18,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2025-03-17 19:55:18,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:18,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-03-17 19:55:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2025-03-17 19:55:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-17 19:55:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 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 19:55:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2025-03-17 19:55:18,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2025-03-17 19:55:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:55:18,348 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2025-03-17 19:55:18,348 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:55:18,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. [2025-03-17 19:55:18,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 19:55:18,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:18,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:18,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:18,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:55:18,349 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" [2025-03-17 19:55:18,349 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" [2025-03-17 19:55:18,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1142905058, now seen corresponding path program 1 times [2025-03-17 19:55:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432876768] [2025-03-17 19:55:18,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:18,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:18,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:18,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:18,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:18,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:18,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:18,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2816, now seen corresponding path program 2 times [2025-03-17 19:55:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330874868] [2025-03-17 19:55:18,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:18,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:18,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:18,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:18,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:18,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:18,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:18,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:18,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:18,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1179865183, now seen corresponding path program 1 times [2025-03-17 19:55:18,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:18,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598925176] [2025-03-17 19:55:18,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:18,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:55:18,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:55:18,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:18,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:55:18,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:55:18,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:18,638 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 19:55:18,859 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:18,859 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:18,859 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:18,859 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:18,859 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:18,859 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,859 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:18,859 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:18,859 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration4_Lasso [2025-03-17 19:55:18,859 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:18,859 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:18,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:19,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:19,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:19,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:19,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:19,260 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:19,260 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:19,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,262 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 19:55:19,264 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 19:55:19,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 19:55:19,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,280 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 19:55:19,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,282 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 19:55:19,283 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 19:55:19,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 19:55:19,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,303 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 19:55:19,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,305 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:19,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:55:19,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 19:55:19,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,327 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:19,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:55:19,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:19,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:19,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,351 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 19:55:19,352 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 19:55:19,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:19,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,370 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 19:55:19,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,372 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 19:55:19,372 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 19:55:19,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,391 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 19:55:19,392 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 19:55:19,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,407 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 19:55:19,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,409 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 19:55:19,410 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 19:55:19,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 19:55:19,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,426 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 19:55:19,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,428 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 19:55:19,428 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 19:55:19,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 19:55:19,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 19:55:19,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,446 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 19:55:19,447 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 19:55:19,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,472 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 19:55:19,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,473 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 19:55:19,474 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 19:55:19,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,490 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 19:55:19,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,492 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 19:55:19,493 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 19:55:19,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:55:19,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,511 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 19:55:19,511 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 19:55:19,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 19:55:19,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,528 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 19:55:19,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,530 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 19:55:19,531 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 19:55:19,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 19:55:19,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,549 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 19:55:19,551 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 19:55:19,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,567 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 19:55:19,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,568 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 19:55:19,569 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 19:55:19,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:19,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,585 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 19:55:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,587 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 19:55:19,587 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 19:55:19,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 19:55:19,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,604 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 19:55:19,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,606 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 19:55:19,607 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 19:55:19,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:19,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 19:55:19,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,625 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 19:55:19,626 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 19:55:19,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,644 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 19:55:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,646 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 19:55:19,647 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 19:55:19,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,669 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 19:55:19,674 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 19:55:19,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,695 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 19:55:19,697 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 19:55:19,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:19,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:19,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,720 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 19:55:19,721 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 19:55:19,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 19:55:19,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,742 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 19:55:19,745 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 19:55:19,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,763 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 19:55:19,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,766 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 19:55:19,766 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 19:55:19,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,785 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 19:55:19,786 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 19:55:19,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,802 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 19:55:19,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,804 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 19:55:19,805 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 19:55:19,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 19:55:19,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,823 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 19:55:19,823 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 19:55:19,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 19:55:19,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,840 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 19:55:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,842 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 19:55:19,843 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 19:55:19,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:19,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 19:55:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,860 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 19:55:19,862 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 19:55:19,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:19,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,878 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 19:55:19,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,880 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 19:55:19,880 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 19:55:19,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,897 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 19:55:19,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,899 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 19:55:19,899 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 19:55:19,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:19,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,915 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 19:55:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,917 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 19:55:19,918 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 19:55:19,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:19,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,935 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 19:55:19,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,936 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 19:55:19,937 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 19:55:19,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,954 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 19:55:19,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,956 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 19:55:19,956 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 19:55:19,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:19,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,974 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 19:55:19,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,975 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 19:55:19,976 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 19:55:19,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:19,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:19,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:19,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:19,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:19,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:19,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:19,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:19,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:19,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:19,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,994 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 19:55:19,995 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 19:55:19,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:20,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:20,014 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 19:55:20,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,016 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 19:55:20,016 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 19:55:20,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:20,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:20,036 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 19:55:20,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,038 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 19:55:20,039 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 19:55:20,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 19:55:20,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:20,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:20,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,069 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 19:55:20,070 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 19:55:20,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:20,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:20,089 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 19:55:20,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,091 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 19:55:20,093 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 19:55:20,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:20,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:20,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:20,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,115 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 19:55:20,117 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 19:55:20,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:20,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:20,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:20,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,140 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 19:55:20,142 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 19:55:20,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:20,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:20,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,168 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 19:55:20,170 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 19:55:20,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:20,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:20,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:20,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,191 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 19:55:20,193 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 19:55:20,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:20,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:20,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:20,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:20,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:20,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:20,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:20,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:20,227 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 19:55:20,227 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-17 19:55:20,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:20,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,229 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 19:55:20,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 19:55:20,231 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:20,240 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:20,240 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:20,241 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_2) = -1*ULTIMATE.start_strlen_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_2 Supporting invariants [] [2025-03-17 19:55:20,246 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 19:55:20,261 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 19:55:20,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:55:20,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:55:20,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-17 19:55:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:20,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:20,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:20,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:55:20,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:20,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:20,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:20,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:20,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:55:20,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:20,332 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 19:55:20,333 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-17 19:55:20,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 42 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:20,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 42 transitions. cyclomatic complexity: 17. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 70 transitions. Complement of second has 7 states. [2025-03-17 19:55:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2025-03-17 19:55:20,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-17 19:55:20,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:20,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-17 19:55:20,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:20,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-17 19:55:20,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:20,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 70 transitions. [2025-03-17 19:55:20,384 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-03-17 19:55:20,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 48 states and 66 transitions. [2025-03-17 19:55:20,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-03-17 19:55:20,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-17 19:55:20,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. [2025-03-17 19:55:20,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:20,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 66 transitions. [2025-03-17 19:55:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. [2025-03-17 19:55:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2025-03-17 19:55:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2025-03-17 19:55:20,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 44 transitions. [2025-03-17 19:55:20,386 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2025-03-17 19:55:20,386 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:55:20,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2025-03-17 19:55:20,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:55:20,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:20,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:20,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:20,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:55:20,387 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" [2025-03-17 19:55:20,388 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" [2025-03-17 19:55:20,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1070285403, now seen corresponding path program 1 times [2025-03-17 19:55:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:20,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242178964] [2025-03-17 19:55:20,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:20,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:20,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:55:20,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:55:20,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:20,424 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 19:55:20,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:20,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242178964] [2025-03-17 19:55:20,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242178964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:20,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:20,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:55:20,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187418624] [2025-03-17 19:55:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:20,425 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:20,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 1 times [2025-03-17 19:55:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:20,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406390105] [2025-03-17 19:55:20,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:20,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:20,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:20,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:20,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:20,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:20,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:20,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:55:20,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:55:20,465 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:20,480 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-03-17 19:55:20,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2025-03-17 19:55:20,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:55:20,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 42 transitions. [2025-03-17 19:55:20,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-17 19:55:20,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 19:55:20,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2025-03-17 19:55:20,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:20,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-17 19:55:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2025-03-17 19:55:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 19:55:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 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 19:55:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-03-17 19:55:20,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-17 19:55:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:55:20,486 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-17 19:55:20,486 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:55:20,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2025-03-17 19:55:20,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:55:20,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:20,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:20,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:20,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:55:20,487 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" [2025-03-17 19:55:20,487 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" [2025-03-17 19:55:20,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,488 INFO L85 PathProgramCache]: Analyzing trace with hash -900810472, now seen corresponding path program 1 times [2025-03-17 19:55:20,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:20,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712286611] [2025-03-17 19:55:20,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:20,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:20,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:55:20,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:55:20,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:20,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:55:20,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:55:20,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 2 times [2025-03-17 19:55:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:20,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127916194] [2025-03-17 19:55:20,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:20,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:20,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:20,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:20,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:20,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:20,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:20,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:20,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1904531607, now seen corresponding path program 1 times [2025-03-17 19:55:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:20,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6480695] [2025-03-17 19:55:20,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:20,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:20,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:20,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:20,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:20,656 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 19:55:20,769 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 19:55:20,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:20,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6480695] [2025-03-17 19:55:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6480695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:20,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:55:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940684742] [2025-03-17 19:55:20,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:20,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:55:20,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:55:20,801 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:20,888 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2025-03-17 19:55:20,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2025-03-17 19:55:20,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-17 19:55:20,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 78 transitions. [2025-03-17 19:55:20,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-03-17 19:55:20,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-03-17 19:55:20,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 78 transitions. [2025-03-17 19:55:20,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:20,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 78 transitions. [2025-03-17 19:55:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 78 transitions. [2025-03-17 19:55:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2025-03-17 19:55:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-03-17 19:55:20,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-17 19:55:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:55:20,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-17 19:55:20,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:55:20,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2025-03-17 19:55:20,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:55:20,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:20,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:20,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:20,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:55:20,898 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" [2025-03-17 19:55:20,898 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" [2025-03-17 19:55:20,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1231144401, now seen corresponding path program 1 times [2025-03-17 19:55:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:20,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980157707] [2025-03-17 19:55:20,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:20,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:20,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:55:20,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:55:20,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:20,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:55:20,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:55:20,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 3 times [2025-03-17 19:55:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:20,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294450390] [2025-03-17 19:55:20,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:20,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:20,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:20,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:20,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:20,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:20,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:20,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2013761554, now seen corresponding path program 1 times [2025-03-17 19:55:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:20,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641539263] [2025-03-17 19:55:20,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:20,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:55:20,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:55:20,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:20,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:55:20,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:55:20,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:20,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:20,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:21,688 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:21,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:21,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:21,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:21,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:21,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:21,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:21,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:21,688 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2025-03-17 19:55:21,688 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:21,688 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:21,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:21,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:22,081 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:22,082 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,084 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 19:55:22,085 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 19:55:22,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,103 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 19:55:22,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,104 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 19:55:22,105 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 19:55:22,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,122 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 19:55:22,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,124 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 19:55:22,125 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 19:55:22,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-17 19:55:22,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,143 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 19:55:22,143 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 19:55:22,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,159 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 19:55:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,161 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 19:55:22,162 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 19:55:22,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,178 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 19:55:22,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,179 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 19:55:22,180 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 19:55:22,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,197 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 19:55:22,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,198 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 19:55:22,199 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 19:55:22,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,216 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 19:55:22,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,217 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 19:55:22,218 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 19:55:22,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,234 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 19:55:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,236 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 19:55:22,236 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 19:55:22,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 19:55:22,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,253 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 19:55:22,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,255 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 19:55:22,256 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 19:55:22,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,272 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 19:55:22,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,274 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 19:55:22,274 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 19:55:22,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,286 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,292 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 19:55:22,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,294 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 19:55:22,294 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 19:55:22,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:22,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,314 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 19:55:22,316 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 19:55:22,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,333 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 19:55:22,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,335 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 19:55:22,336 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 19:55:22,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,353 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 19:55:22,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,355 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 19:55:22,355 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 19:55:22,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 19:55:22,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,403 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 19:55:22,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,406 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 19:55:22,412 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 19:55:22,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-17 19:55:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,431 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:22,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-17 19:55:22,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 19:55:22,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:22,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:22,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:22,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-17 19:55:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,452 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 19:55:22,453 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 19:55:22,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:22,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:22,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,471 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 19:55:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,473 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 19:55:22,473 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 19:55:22,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:22,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:22,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:22,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:22,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,500 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 19:55:22,503 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 19:55:22,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:22,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:22,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:22,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:22,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,525 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 19:55:22,525 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 19:55:22,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:22,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:22,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:22,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:22,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:22,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:22,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:22,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:22,566 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-17 19:55:22,566 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:55:22,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:22,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:22,568 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 19:55:22,568 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 19:55:22,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:22,579 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 19:55:22,579 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:22,579 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s#1.offset) = -2*ULTIMATE.start_strlen_~s#1.offset + 3 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_2 + 2 >= 0] [2025-03-17 19:55:22,585 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 19:55:22,604 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-17 19:55:22,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-17 19:55:22,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:22,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:55:22,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:55:22,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:22,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:22,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 19:55:22,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:22,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-17 19:55:22,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:55:22,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 19:55:22,720 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:55:22,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:55:22,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:22,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:22,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:22,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:22,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:55:22,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:22,788 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 19:55:22,789 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-17 19:55:22,789 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 62 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:22,936 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 62 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 92 states and 123 transitions. Complement of second has 11 states. [2025-03-17 19:55:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-17 19:55:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2025-03-17 19:55:22,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-17 19:55:22,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:22,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-17 19:55:22,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:22,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-17 19:55:22,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:22,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 123 transitions. [2025-03-17 19:55:22,939 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2025-03-17 19:55:22,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 90 states and 121 transitions. [2025-03-17 19:55:22,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-03-17 19:55:22,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-03-17 19:55:22,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 121 transitions. [2025-03-17 19:55:22,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:22,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 121 transitions. [2025-03-17 19:55:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 121 transitions. [2025-03-17 19:55:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2025-03-17 19:55:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.380952380952381) internal successors, (87), 62 states have internal predecessors, (87), 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 19:55:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-03-17 19:55:22,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-03-17 19:55:22,948 INFO L432 stractBuchiCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-03-17 19:55:22,948 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:55:22,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 87 transitions. [2025-03-17 19:55:22,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:55:22,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:22,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:22,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:22,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:55:22,951 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" [2025-03-17 19:55:22,951 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" [2025-03-17 19:55:22,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1413405688, now seen corresponding path program 2 times [2025-03-17 19:55:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:22,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418992425] [2025-03-17 19:55:22,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:22,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:55:22,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:22,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:22,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:22,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:22,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:22,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:22,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:22,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:22,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 4 times [2025-03-17 19:55:22,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:22,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075914722] [2025-03-17 19:55:22,979 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:22,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:22,981 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 19:55:22,982 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 19:55:22,982 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:22,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:22,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:22,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:22,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:22,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:22,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1073202039, now seen corresponding path program 2 times [2025-03-17 19:55:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:22,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733559379] [2025-03-17 19:55:22,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:22,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:55:22,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:55:22,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:22,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:23,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:55:23,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:55:23,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:23,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:23,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:23,720 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 19:55:23,908 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:23,908 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:23,908 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:23,908 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:23,908 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:23,908 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:23,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:23,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:23,908 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration8_Lasso [2025-03-17 19:55:23,908 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:23,908 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:23,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:23,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,273 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:24,273 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:24,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,278 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 19:55:24,278 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 19:55:24,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:24,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,299 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 19:55:24,300 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 19:55:24,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:24,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,319 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 19:55:24,319 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 19:55:24,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-17 19:55:24,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,337 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:24,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-17 19:55:24,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 19:55:24,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-17 19:55:24,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,355 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:24,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-17 19:55:24,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:24,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-17 19:55:24,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,397 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 19:55:24,398 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 19:55:24,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,414 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 19:55:24,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,416 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 19:55:24,416 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 19:55:24,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,433 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 19:55:24,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,434 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 19:55:24,435 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 19:55:24,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:24,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,454 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 19:55:24,455 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 19:55:24,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-17 19:55:24,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,474 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 19:55:24,475 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 19:55:24,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,491 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 19:55:24,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,493 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 19:55:24,493 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 19:55:24,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,511 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 19:55:24,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,513 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 19:55:24,518 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 19:55:24,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:24,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:24,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,537 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 19:55:24,538 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 19:55:24,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,555 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 19:55:24,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,556 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 19:55:24,557 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 19:55:24,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,574 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 19:55:24,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,576 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 19:55:24,576 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 19:55:24,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,593 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 19:55:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,595 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 19:55:24,595 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 19:55:24,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 19:55:24,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,612 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 19:55:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,614 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 19:55:24,614 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 19:55:24,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-17 19:55:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,633 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 19:55:24,633 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 19:55:24,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,650 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 19:55:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,652 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 19:55:24,652 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 19:55:24,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,669 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 19:55:24,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,670 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 19:55:24,671 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 19:55:24,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:24,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:24,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,689 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 19:55:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,691 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 19:55:24,692 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 19:55:24,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,702 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:55:24,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,704 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-17 19:55:24,704 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:55:24,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,715 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 19:55:24,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,717 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 19:55:24,717 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 19:55:24,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:24,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:24,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:24,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,734 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 19:55:24,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,736 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 19:55:24,736 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 19:55:24,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:24,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:24,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,757 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 19:55:24,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,758 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:24,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-17 19:55:24,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:24,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:24,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:24,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:24,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-17 19:55:24,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,779 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:24,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-17 19:55:24,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 19:55:24,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:24,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:24,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:24,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:24,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:24,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:24,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:24,805 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 19:55:24,805 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:55:24,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:24,806 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 19:55:24,807 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 19:55:24,808 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:24,817 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:24,818 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:24,818 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s#1.offset, v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_3) = -1*ULTIMATE.start_strlen_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_3 Supporting invariants [] [2025-03-17 19:55:24,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-17 19:55:24,831 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 19:55:24,832 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-17 19:55:24,832 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:55:24,832 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:55:24,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:24,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:24,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:24,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:24,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:24,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:24,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:24,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:24,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:24,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:24,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:24,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:55:24,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:24,886 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 19:55:24,887 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 19:55:24,887 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 87 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:24,900 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 87 transitions. cyclomatic complexity: 34. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 112 transitions. Complement of second has 5 states. [2025-03-17 19:55:24,903 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 19:55:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2025-03-17 19:55:24,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-17 19:55:24,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:24,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 15 letters. Loop has 2 letters. [2025-03-17 19:55:24,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:24,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 13 letters. Loop has 4 letters. [2025-03-17 19:55:24,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:24,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 112 transitions. [2025-03-17 19:55:24,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-03-17 19:55:24,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 76 states and 104 transitions. [2025-03-17 19:55:24,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-03-17 19:55:24,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-03-17 19:55:24,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 104 transitions. [2025-03-17 19:55:24,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:24,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-03-17 19:55:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 104 transitions. [2025-03-17 19:55:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 47. [2025-03-17 19:55:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 46 states have internal predecessors, (64), 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 19:55:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2025-03-17 19:55:24,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2025-03-17 19:55:24,907 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 64 transitions. [2025-03-17 19:55:24,907 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:55:24,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 64 transitions. [2025-03-17 19:55:24,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:55:24,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:24,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:24,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:24,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:24,908 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" [2025-03-17 19:55:24,908 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" [2025-03-17 19:55:24,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1089128820, now seen corresponding path program 1 times [2025-03-17 19:55:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007694312] [2025-03-17 19:55:24,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:24,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:55:24,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:55:24,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:24,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:24,954 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 19:55:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007694312] [2025-03-17 19:55:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007694312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:55:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919782562] [2025-03-17 19:55:24,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:24,955 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:24,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash 57547, now seen corresponding path program 1 times [2025-03-17 19:55:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:24,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709236759] [2025-03-17 19:55:24,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:24,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:24,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:24,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:24,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:24,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:24,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:24,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:24,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:24,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:24,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:25,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:25,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:55:25,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:55:25,040 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. cyclomatic complexity: 24 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:25,070 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2025-03-17 19:55:25,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2025-03-17 19:55:25,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:55:25,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 62 transitions. [2025-03-17 19:55:25,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-17 19:55:25,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-17 19:55:25,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 62 transitions. [2025-03-17 19:55:25,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:25,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 62 transitions. [2025-03-17 19:55:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 62 transitions. [2025-03-17 19:55:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 19:55:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2025-03-17 19:55:25,074 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 62 transitions. [2025-03-17 19:55:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:55:25,075 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2025-03-17 19:55:25,075 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:55:25,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2025-03-17 19:55:25,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:55:25,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:25,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:25,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:25,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:25,077 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" [2025-03-17 19:55:25,077 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" [2025-03-17 19:55:25,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash -72554639, now seen corresponding path program 1 times [2025-03-17 19:55:25,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:25,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048064077] [2025-03-17 19:55:25,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:25,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:25,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:55:25,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:55:25,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:25,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:25,147 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 19:55:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:25,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048064077] [2025-03-17 19:55:25,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048064077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:25,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:25,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:55:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212581632] [2025-03-17 19:55:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:25,147 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:25,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash 57547, now seen corresponding path program 2 times [2025-03-17 19:55:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709736049] [2025-03-17 19:55:25,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:25,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:25,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:25,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:25,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:25,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:25,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:25,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:25,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:25,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:25,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:25,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:25,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:55:25,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:55:25,242 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 19:55:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:25,269 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2025-03-17 19:55:25,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 89 transitions. [2025-03-17 19:55:25,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:55:25,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 49 states and 60 transitions. [2025-03-17 19:55:25,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 19:55:25,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-17 19:55:25,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 60 transitions. [2025-03-17 19:55:25,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:25,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-03-17 19:55:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 60 transitions. [2025-03-17 19:55:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2025-03-17 19:55:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.255813953488372) internal successors, (54), 42 states have internal predecessors, (54), 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 19:55:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-03-17 19:55:25,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-17 19:55:25,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:55:25,276 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-17 19:55:25,276 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:55:25,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2025-03-17 19:55:25,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:55:25,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:25,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:25,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:25,277 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:25,277 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" [2025-03-17 19:55:25,277 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" [2025-03-17 19:55:25,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1005588206, now seen corresponding path program 1 times [2025-03-17 19:55:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23160267] [2025-03-17 19:55:25,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:25,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:55:25,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:55:25,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:25,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:25,355 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 19:55:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:55:25,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:25,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23160267] [2025-03-17 19:55:25,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23160267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:25,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242459485] [2025-03-17 19:55:25,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:25,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:25,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:25,473 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:25,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-03-17 19:55:25,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:55:25,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:55:25,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:25,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:25,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 19:55:25,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:25,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-17 19:55:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:55:25,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:55:25,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242459485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:25,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:25,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 28 [2025-03-17 19:55:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080511419] [2025-03-17 19:55:25,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:25,864 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:25,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash 57547, now seen corresponding path program 3 times [2025-03-17 19:55:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117757210] [2025-03-17 19:55:25,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:25,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:25,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:25,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:25,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:25,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:25,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:25,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:25,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:25,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:25,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:25,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 19:55:25,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-03-17 19:55:25,947 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. cyclomatic complexity: 18 Second operand has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:26,532 INFO L93 Difference]: Finished difference Result 160 states and 194 transitions. [2025-03-17 19:55:26,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 194 transitions. [2025-03-17 19:55:26,533 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2025-03-17 19:55:26,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 138 states and 169 transitions. [2025-03-17 19:55:26,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-03-17 19:55:26,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-03-17 19:55:26,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 169 transitions. [2025-03-17 19:55:26,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:26,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 169 transitions. [2025-03-17 19:55:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 169 transitions. [2025-03-17 19:55:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 60. [2025-03-17 19:55:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 59 states have internal predecessors, (74), 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 19:55:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2025-03-17 19:55:26,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 74 transitions. [2025-03-17 19:55:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 19:55:26,538 INFO L432 stractBuchiCegarLoop]: Abstraction has 60 states and 74 transitions. [2025-03-17 19:55:26,538 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:55:26,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 74 transitions. [2025-03-17 19:55:26,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:55:26,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:26,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:26,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:26,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:26,540 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" [2025-03-17 19:55:26,540 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" [2025-03-17 19:55:26,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:26,541 INFO L85 PathProgramCache]: Analyzing trace with hash 259662454, now seen corresponding path program 1 times [2025-03-17 19:55:26,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:26,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627042616] [2025-03-17 19:55:26,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:26,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:26,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:55:26,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:55:26,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:26,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:26,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:26,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:55:26,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:55:26,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:26,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:26,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:26,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash 57547, now seen corresponding path program 4 times [2025-03-17 19:55:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140292548] [2025-03-17 19:55:26,584 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:26,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-17 19:55:26,587 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:26,587 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:26,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:26,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:26,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:26,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:26,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:26,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:26,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:26,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:26,590 INFO L85 PathProgramCache]: Analyzing trace with hash 368094774, now seen corresponding path program 1 times [2025-03-17 19:55:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:26,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23135568] [2025-03-17 19:55:26,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:26,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:55:26,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:55:26,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:26,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:26,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:26,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:55:26,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:55:26,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:26,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:26,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:27,881 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:27,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:27,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:27,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:27,882 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:27,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:27,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:27,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:27,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration12_Lasso [2025-03-17 19:55:27,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:27,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:27,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:27,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:28,408 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:28,409 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,410 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 19:55:28,411 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 19:55:28,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:28,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,427 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 19:55:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,429 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 19:55:28,429 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 19:55:28,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-03-17 19:55:28,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,448 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 19:55:28,448 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 19:55:28,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:28,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,466 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 19:55:28,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,468 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 19:55:28,470 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 19:55:28,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 19:55:28,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:28,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,489 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 19:55:28,490 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 19:55:28,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:28,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,508 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 19:55:28,509 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 19:55:28,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 19:55:28,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,526 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 19:55:28,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,527 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 19:55:28,529 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 19:55:28,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:28,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,545 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 19:55:28,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,547 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 19:55:28,547 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 19:55:28,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,563 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 19:55:28,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,565 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 19:55:28,566 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 19:55:28,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,582 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 19:55:28,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,584 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 19:55:28,584 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 19:55:28,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 19:55:28,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,601 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 19:55:28,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,602 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 19:55:28,603 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 19:55:28,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,619 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 19:55:28,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,621 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 19:55:28,622 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 19:55:28,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:28,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,640 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 19:55:28,642 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 19:55:28,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,658 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 19:55:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,659 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 19:55:28,670 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 19:55:28,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:28,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,689 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 19:55:28,689 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 19:55:28,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-17 19:55:28,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,709 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 19:55:28,709 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 19:55:28,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,726 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 19:55:28,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,727 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 19:55:28,728 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 19:55:28,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,744 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 19:55:28,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,746 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 19:55:28,746 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 19:55:28,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,763 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 19:55:28,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,766 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 19:55:28,767 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 19:55:28,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:28,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,786 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 19:55:28,786 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 19:55:28,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,803 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 19:55:28,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,805 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 19:55:28,805 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 19:55:28,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-03-17 19:55:28,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,823 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 19:55:28,824 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 19:55:28,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:28,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:28,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-03-17 19:55:28,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,846 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 19:55:28,847 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 19:55:28,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:28,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,863 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 19:55:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,864 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 19:55:28,865 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 19:55:28,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 19:55:28,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,881 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 19:55:28,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,883 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 19:55:28,883 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 19:55:28,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-03-17 19:55:28,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,901 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 19:55:28,902 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 19:55:28,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,918 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 19:55:28,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,919 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 19:55:28,920 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 19:55:28,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,937 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 19:55:28,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,939 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 19:55:28,941 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 19:55:28,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,958 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 19:55:28,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,960 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 19:55:28,961 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 19:55:28,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 19:55:28,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:28,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:28,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:28,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:28,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:28,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:28,981 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 19:55:28,982 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 19:55:28,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:28,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:28,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:28,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:28,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:28,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:28,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:28,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:29,000 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 19:55:29,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:29,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:29,001 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 19:55:29,002 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 19:55:29,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:29,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:29,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:29,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:29,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:29,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:29,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:29,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:29,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:29,018 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 19:55:29,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:29,019 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 19:55:29,020 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 19:55:29,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:29,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:29,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:29,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:29,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:29,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:29,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:29,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:29,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:29,036 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 19:55:29,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:29,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:29,038 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 19:55:29,039 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 19:55:29,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:29,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:29,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:29,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:29,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:29,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:29,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:29,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:29,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:29,055 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 19:55:29,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:29,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:29,057 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 19:55:29,057 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 19:55:29,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:29,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:29,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:29,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:29,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:29,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:29,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:29,075 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:29,084 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 19:55:29,084 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 19:55:29,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:29,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:29,085 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 19:55:29,086 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 19:55:29,087 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:29,096 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:29,096 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:29,097 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack#1.offset, v_rep(select #length ULTIMATE.start_strstr_~haystack#1.base)_1) = -1*ULTIMATE.start_strstr_~haystack#1.offset + 1*v_rep(select #length ULTIMATE.start_strstr_~haystack#1.base)_1 Supporting invariants [] [2025-03-17 19:55:29,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:29,120 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 19:55:29,121 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:55:29,121 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:55:29,121 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~haystack!offset [2025-03-17 19:55:29,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:29,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:55:29,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:55:29,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:29,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:29,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:29,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:29,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:29,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:29,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:29,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:29,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:55:29,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:29,185 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 19:55:29,186 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 19:55:29,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 74 transitions. cyclomatic complexity: 21 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 19:55:29,201 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 74 transitions. cyclomatic complexity: 21. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 68 states and 86 transitions. Complement of second has 4 states. [2025-03-17 19:55:29,202 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 19:55:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 19:55:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-03-17 19:55:29,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 23 letters. Loop has 3 letters. [2025-03-17 19:55:29,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:29,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 26 letters. Loop has 3 letters. [2025-03-17 19:55:29,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:29,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 23 letters. Loop has 6 letters. [2025-03-17 19:55:29,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:29,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 86 transitions. [2025-03-17 19:55:29,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:29,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 65 states and 81 transitions. [2025-03-17 19:55:29,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-03-17 19:55:29,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-17 19:55:29,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2025-03-17 19:55:29,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:29,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-17 19:55:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2025-03-17 19:55:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 19:55:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 64 states have internal predecessors, (81), 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 19:55:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-17 19:55:29,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-17 19:55:29,210 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-17 19:55:29,210 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:55:29,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2025-03-17 19:55:29,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:29,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:29,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:29,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:29,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:29,211 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:29,211 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash 427516020, now seen corresponding path program 1 times [2025-03-17 19:55:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041697551] [2025-03-17 19:55:29,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:29,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:29,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:55:29,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:55:29,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:29,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:29,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:29,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:55:29,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:55:29,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:29,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:29,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:29,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 1 times [2025-03-17 19:55:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109584512] [2025-03-17 19:55:29,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:29,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:29,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:29,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:29,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:29,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:29,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:29,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:29,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:29,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:29,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:29,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1551742976, now seen corresponding path program 1 times [2025-03-17 19:55:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093931092] [2025-03-17 19:55:29,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:29,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:55:29,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:55:29,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:29,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:29,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:29,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:55:29,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:55:29,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:29,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:29,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:29,567 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 19:55:31,756 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:31,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:31,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:31,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:31,756 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:31,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:31,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:31,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:31,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration13_Lasso [2025-03-17 19:55:31,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:31,756 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:31,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:31,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:32,627 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:32,627 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:32,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,629 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 19:55:32,630 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 19:55:32,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:32,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,649 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 19:55:32,650 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 19:55:32,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 19:55:32,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:32,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:32,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,668 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 19:55:32,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,670 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 19:55:32,675 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 19:55:32,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,691 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 19:55:32,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,693 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 19:55:32,693 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 19:55:32,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:32,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,709 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 19:55:32,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,711 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/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 19:55:32,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-03-17 19:55:32,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 19:55:32,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-03-17 19:55:32,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,730 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 19:55:32,730 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 19:55:32,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,747 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 19:55:32,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,749 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 19:55:32,750 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 19:55:32,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:32,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,769 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 19:55:32,769 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 19:55:32,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,786 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 19:55:32,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,788 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 19:55:32,789 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 19:55:32,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,806 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 19:55:32,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,807 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 19:55:32,808 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 19:55:32,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-03-17 19:55:32,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,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 19:55:32,827 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 19:55:32,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,845 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 19:55:32,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,847 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 19:55:32,847 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 19:55:32,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,865 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 19:55:32,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,867 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 19:55:32,867 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 19:55:32,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:32,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-03-17 19:55:32,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,886 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/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 19:55:32,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-03-17 19:55:32,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-03-17 19:55:32,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,906 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/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 19:55:32,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-03-17 19:55:32,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:32,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,925 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/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 19:55:32,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-03-17 19:55:32,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:32,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,945 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/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 19:55:32,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-03-17 19:55:32,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-03-17 19:55:32,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,964 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/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 19:55:32,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-03-17 19:55:32,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:32,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:32,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-03-17 19:55:32,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,984 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/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 19:55:32,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-03-17 19:55:32,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 19:55:32,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:32,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:32,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:32,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:32,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:32,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:32,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:32,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:33,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-03-17 19:55:33,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,003 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/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 19:55:33,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-03-17 19:55:33,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:33,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:33,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:33,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:33,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:33,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:33,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:33,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:33,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,027 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/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 19:55:33,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-03-17 19:55:33,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:33,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:33,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:33,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:33,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:33,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:33,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:33,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-03-17 19:55:33,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,052 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/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 19:55:33,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-03-17 19:55:33,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:33,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:33,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:33,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:33,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:33,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:33,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:33,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2025-03-17 19:55:33,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,072 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/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 19:55:33,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-03-17 19:55:33,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:33,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:33,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:33,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:33,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:33,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:33,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:33,162 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2025-03-17 19:55:33,162 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2025-03-17 19:55:33,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,165 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/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 19:55:33,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-03-17 19:55:33,169 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:33,180 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:33,181 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:33,181 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_memcmp_~d~0#1.base)_1, ULTIMATE.start_memcmp_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_memcmp_~d~0#1.base)_1 - 1*ULTIMATE.start_memcmp_~s~0#1.offset Supporting invariants [] [2025-03-17 19:55:33,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-03-17 19:55:33,244 INFO L156 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2025-03-17 19:55:33,245 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-17 19:55:33,245 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:55:33,245 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:55:33,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:33,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:55:33,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:55:33,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:33,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:33,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:55:33,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:33,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:33,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:33,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:33,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:33,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:55:33,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:33,451 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 19:55:33,452 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-17 19:55:33,452 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 24 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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 19:55:33,574 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 24. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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) Result 96 states and 118 transitions. Complement of second has 16 states. [2025-03-17 19:55:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:55:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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 19:55:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2025-03-17 19:55:33,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 42 transitions. Stem has 25 letters. Loop has 3 letters. [2025-03-17 19:55:33,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:33,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 42 transitions. Stem has 28 letters. Loop has 3 letters. [2025-03-17 19:55:33,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:33,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 42 transitions. Stem has 25 letters. Loop has 6 letters. [2025-03-17 19:55:33,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:33,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 118 transitions. [2025-03-17 19:55:33,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:33,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 86 states and 106 transitions. [2025-03-17 19:55:33,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-17 19:55:33,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-17 19:55:33,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 106 transitions. [2025-03-17 19:55:33,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:33,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 106 transitions. [2025-03-17 19:55:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 106 transitions. [2025-03-17 19:55:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2025-03-17 19:55:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 70 states have internal predecessors, (89), 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 19:55:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2025-03-17 19:55:33,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 89 transitions. [2025-03-17 19:55:33,581 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 89 transitions. [2025-03-17 19:55:33,581 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 19:55:33,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 89 transitions. [2025-03-17 19:55:33,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:33,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:33,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:33,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:33,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:33,582 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:33,582 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:33,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:33,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1551760436, now seen corresponding path program 1 times [2025-03-17 19:55:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:33,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382262308] [2025-03-17 19:55:33,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:55:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:55:33,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:33,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:33,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-03-17 19:55:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:55:33,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:33,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382262308] [2025-03-17 19:55:33,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382262308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:33,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180550359] [2025-03-17 19:55:33,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:33,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,743 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:33,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2025-03-17 19:55:33,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:55:33,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:55:33,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:33,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:33,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-17 19:55:33,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:33,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 19:55:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:55:34,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:55:34,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180550359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:34,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:34,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 33 [2025-03-17 19:55:34,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062468416] [2025-03-17 19:55:34,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:34,280 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:34,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 2 times [2025-03-17 19:55:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005695791] [2025-03-17 19:55:34,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:34,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:34,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:34,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:34,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:34,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:34,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:34,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:34,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:34,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:34,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:34,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:34,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 19:55:34,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 19:55:34,376 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. cyclomatic complexity: 27 Second operand has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 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 19:55:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:35,039 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2025-03-17 19:55:35,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 225 transitions. [2025-03-17 19:55:35,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-17 19:55:35,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 166 states and 204 transitions. [2025-03-17 19:55:35,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-03-17 19:55:35,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-03-17 19:55:35,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 204 transitions. [2025-03-17 19:55:35,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:35,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 166 states and 204 transitions. [2025-03-17 19:55:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 204 transitions. [2025-03-17 19:55:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 97. [2025-03-17 19:55:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 96 states have internal predecessors, (119), 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 19:55:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2025-03-17 19:55:35,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 119 transitions. [2025-03-17 19:55:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-17 19:55:35,047 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 119 transitions. [2025-03-17 19:55:35,047 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 19:55:35,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 119 transitions. [2025-03-17 19:55:35,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:35,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:35,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:35,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:35,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:35,048 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:35,049 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:35,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash -113775467, now seen corresponding path program 2 times [2025-03-17 19:55:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458448163] [2025-03-17 19:55:35,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:35,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 19:55:35,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:55:35,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:35,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:55:35,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458448163] [2025-03-17 19:55:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458448163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64295155] [2025-03-17 19:55:35,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:35,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:35,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:35,481 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:35,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2025-03-17 19:55:35,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 19:55:35,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:55:35,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:35,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:35,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-17 19:55:35,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:35,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:55:35,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:55:35,632 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:55:35,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:55:35,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:55:35,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:55:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:55:35,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:36,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:55:36,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-17 19:55:36,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:55:36,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2025-03-17 19:55:36,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:55:36,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-17 19:55:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:55:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64295155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:36,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 30 [2025-03-17 19:55:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960079728] [2025-03-17 19:55:36,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:36,233 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:36,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 3 times [2025-03-17 19:55:36,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:36,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369621056] [2025-03-17 19:55:36,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:36,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:36,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:36,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:36,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:36,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:36,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:36,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:36,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:36,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:36,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:36,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:36,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 19:55:36,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=785, Unknown=5, NotChecked=0, Total=870 [2025-03-17 19:55:36,318 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. cyclomatic complexity: 32 Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 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 19:55:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:36,899 INFO L93 Difference]: Finished difference Result 188 states and 226 transitions. [2025-03-17 19:55:36,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 226 transitions. [2025-03-17 19:55:36,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:36,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 178 states and 215 transitions. [2025-03-17 19:55:36,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2025-03-17 19:55:36,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2025-03-17 19:55:36,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 215 transitions. [2025-03-17 19:55:36,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:36,901 INFO L218 hiAutomatonCegarLoop]: Abstraction has 178 states and 215 transitions. [2025-03-17 19:55:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 215 transitions. [2025-03-17 19:55:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 123. [2025-03-17 19:55:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.2276422764227641) internal successors, (151), 122 states have internal predecessors, (151), 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 19:55:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2025-03-17 19:55:36,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 151 transitions. [2025-03-17 19:55:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 19:55:36,905 INFO L432 stractBuchiCegarLoop]: Abstraction has 123 states and 151 transitions. [2025-03-17 19:55:36,905 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 19:55:36,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 151 transitions. [2025-03-17 19:55:36,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:36,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:36,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:36,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:36,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:36,906 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:36,906 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 148082297, now seen corresponding path program 1 times [2025-03-17 19:55:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:36,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219959199] [2025-03-17 19:55:36,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:36,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:55:36,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:55:36,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:36,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 19:55:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219959199] [2025-03-17 19:55:37,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219959199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317871459] [2025-03-17 19:55:37,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:37,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:37,233 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:37,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2025-03-17 19:55:37,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:55:37,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:55:37,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:37,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:37,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:55:37,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:37,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:55:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:55:37,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:37,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 19:55:37,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-17 19:55:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:55:37,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317871459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:37,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:37,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2025-03-17 19:55:37,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824234265] [2025-03-17 19:55:37,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:37,425 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 4 times [2025-03-17 19:55:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:37,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826788000] [2025-03-17 19:55:37,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:37,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-17 19:55:37,433 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:37,433 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:37,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:37,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:37,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:37,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:37,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:37,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:55:37,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:55:37,505 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. cyclomatic complexity: 40 Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:37,759 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2025-03-17 19:55:37,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 191 transitions. [2025-03-17 19:55:37,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:37,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 114 states and 140 transitions. [2025-03-17 19:55:37,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-03-17 19:55:37,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-03-17 19:55:37,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 140 transitions. [2025-03-17 19:55:37,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:37,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 140 transitions. [2025-03-17 19:55:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 140 transitions. [2025-03-17 19:55:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2025-03-17 19:55:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.2342342342342343) internal successors, (137), 110 states have internal predecessors, (137), 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 19:55:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2025-03-17 19:55:37,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 137 transitions. [2025-03-17 19:55:37,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:55:37,763 INFO L432 stractBuchiCegarLoop]: Abstraction has 111 states and 137 transitions. [2025-03-17 19:55:37,763 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 19:55:37,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 137 transitions. [2025-03-17 19:55:37,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:37,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:37,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:37,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:37,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:37,764 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:37,764 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:37,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash 286854686, now seen corresponding path program 3 times [2025-03-17 19:55:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917443414] [2025-03-17 19:55:37,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:37,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-17 19:55:37,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:55:37,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:55:37,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:37,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:55:37,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:55:37,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:37,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:37,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 5 times [2025-03-17 19:55:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982847012] [2025-03-17 19:55:37,822 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:55:37,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:37,825 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:37,826 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:37,826 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:37,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:37,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:37,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:37,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:37,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:37,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:37,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1296944618, now seen corresponding path program 1 times [2025-03-17 19:55:37,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:37,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098466115] [2025-03-17 19:55:37,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:37,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:55:37,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:55:37,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:37,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:37,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:55:37,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:55:37,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:37,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:41,471 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:41,471 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:41,471 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:41,471 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:41,471 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:41,471 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,472 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:41,472 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:41,472 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration17_Lasso [2025-03-17 19:55:41,472 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:41,472 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:41,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:42,696 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:42,696 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:42,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,698 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/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 19:55:42,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-03-17 19:55:42,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-03-17 19:55:42,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,718 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/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 19:55:42,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-03-17 19:55:42,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-03-17 19:55:42,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,737 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/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 19:55:42,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-03-17 19:55:42,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-03-17 19:55:42,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,756 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/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 19:55:42,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-03-17 19:55:42,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-03-17 19:55:42,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,775 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/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 19:55:42,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-03-17 19:55:42,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 19:55:42,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-03-17 19:55:42,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,794 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/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 19:55:42,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-03-17 19:55:42,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-03-17 19:55:42,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,825 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/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 19:55:42,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-03-17 19:55:42,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:42,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-03-17 19:55:42,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,847 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/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 19:55:42,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-03-17 19:55:42,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,867 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/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 19:55:42,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-03-17 19:55:42,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:42,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-03-17 19:55:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,886 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/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 19:55:42,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-03-17 19:55:42,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:42,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:42,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,906 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/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 19:55:42,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-03-17 19:55:42,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:42,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:42,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-03-17 19:55:42,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,927 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/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 19:55:42,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-03-17 19:55:42,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:42,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,946 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/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 19:55:42,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-03-17 19:55:42,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:42,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:42,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:42,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-03-17 19:55:42,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,967 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/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 19:55:42,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-03-17 19:55:42,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:42,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:42,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:42,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:42,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:42,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:42,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:42,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:42,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-03-17 19:55:42,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:42,989 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/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 19:55:42,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-03-17 19:55:42,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:43,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2025-03-17 19:55:43,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,009 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/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 19:55:43,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-03-17 19:55:43,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-03-17 19:55:43,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,028 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/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 19:55:43,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-03-17 19:55:43,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:43,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-03-17 19:55:43,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,047 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/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 19:55:43,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-03-17 19:55:43,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2025-03-17 19:55:43,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,067 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/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 19:55:43,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-03-17 19:55:43,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2025-03-17 19:55:43,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,086 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/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 19:55:43,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-03-17 19:55:43,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2025-03-17 19:55:43,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,105 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/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 19:55:43,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-03-17 19:55:43,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:43,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2025-03-17 19:55:43,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,125 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/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 19:55:43,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-03-17 19:55:43,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:43,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-03-17 19:55:43,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,144 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/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 19:55:43,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-03-17 19:55:43,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:43,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,163 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/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 19:55:43,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-03-17 19:55:43,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2025-03-17 19:55:43,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,182 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/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 19:55:43,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-03-17 19:55:43,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:43,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,202 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/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 19:55:43,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-03-17 19:55:43,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-03-17 19:55:43,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,221 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/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 19:55:43,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-03-17 19:55:43,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:43,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,241 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/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 19:55:43,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-03-17 19:55:43,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-03-17 19:55:43,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,259 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/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 19:55:43,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-03-17 19:55:43,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 19:55:43,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2025-03-17 19:55:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,278 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/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 19:55:43,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2025-03-17 19:55:43,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2025-03-17 19:55:43,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,297 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/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 19:55:43,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2025-03-17 19:55:43,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 19:55:43,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:43,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:43,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:43,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-03-17 19:55:43,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,316 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/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 19:55:43,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2025-03-17 19:55:43,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:43,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:43,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:43,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2025-03-17 19:55:43,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,339 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/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 19:55:43,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2025-03-17 19:55:43,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:43,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:43,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:43,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:43,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-03-17 19:55:43,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,360 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/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 19:55:43,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2025-03-17 19:55:43,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:43,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:43,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:43,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:43,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:43,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:43,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:43,380 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:43,386 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 19:55:43,386 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:55:43,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:43,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:43,388 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/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 19:55:43,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-03-17 19:55:43,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:43,400 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:43,400 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:43,400 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_memcmp_~s~0#1.base)_2, ULTIMATE.start_memcmp_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_memcmp_~s~0#1.base)_2 - 1*ULTIMATE.start_memcmp_~s~0#1.offset Supporting invariants [] [2025-03-17 19:55:43,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2025-03-17 19:55:43,466 INFO L156 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2025-03-17 19:55:43,467 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-17 19:55:43,467 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:55:43,467 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:55:43,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:43,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:55:43,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:55:43,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:43,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:43,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:43,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:43,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:43,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:43,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:43,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:43,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:55:43,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:43,566 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 19:55:43,567 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 19:55:43,567 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 137 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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 19:55:43,585 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 137 transitions. cyclomatic complexity: 36. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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) Result 147 states and 180 transitions. Complement of second has 7 states. [2025-03-17 19:55:43,585 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 19:55:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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 19:55:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2025-03-17 19:55:43,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 31 letters. Loop has 3 letters. [2025-03-17 19:55:43,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:43,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 34 letters. Loop has 3 letters. [2025-03-17 19:55:43,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:43,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 31 letters. Loop has 6 letters. [2025-03-17 19:55:43,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:43,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 180 transitions. [2025-03-17 19:55:43,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:43,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 126 states and 155 transitions. [2025-03-17 19:55:43,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-03-17 19:55:43,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-03-17 19:55:43,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 155 transitions. [2025-03-17 19:55:43,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:43,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 155 transitions. [2025-03-17 19:55:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 155 transitions. [2025-03-17 19:55:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2025-03-17 19:55:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 115 states have internal predecessors, (142), 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 19:55:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2025-03-17 19:55:43,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 142 transitions. [2025-03-17 19:55:43,594 INFO L432 stractBuchiCegarLoop]: Abstraction has 116 states and 142 transitions. [2025-03-17 19:55:43,594 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-17 19:55:43,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 142 transitions. [2025-03-17 19:55:43,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:43,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:43,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:43,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:43,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:43,596 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume !(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;" "memcmp_#res#1 := 0;" "strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:43,596 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:43,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:43,596 INFO L85 PathProgramCache]: Analyzing trace with hash -529000445, now seen corresponding path program 1 times [2025-03-17 19:55:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:43,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491080944] [2025-03-17 19:55:43,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:43,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:43,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 19:55:43,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:55:43,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:43,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:55:43,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:43,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491080944] [2025-03-17 19:55:43,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491080944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:43,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:55:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958755775] [2025-03-17 19:55:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:43,639 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:43,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 6 times [2025-03-17 19:55:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272207942] [2025-03-17 19:55:43,640 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:55:43,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:43,642 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:43,643 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:43,643 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 19:55:43,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:43,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:43,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:43,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:43,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:43,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:43,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:43,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:43,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:55:43,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:55:43,725 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. cyclomatic complexity: 37 Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 19:55:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:43,733 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2025-03-17 19:55:43,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 144 transitions. [2025-03-17 19:55:43,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:43,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 114 states and 137 transitions. [2025-03-17 19:55:43,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-03-17 19:55:43,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-03-17 19:55:43,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 137 transitions. [2025-03-17 19:55:43,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:43,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 137 transitions. [2025-03-17 19:55:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 137 transitions. [2025-03-17 19:55:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-17 19:55:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 113 states have internal predecessors, (137), 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 19:55:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2025-03-17 19:55:43,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 137 transitions. [2025-03-17 19:55:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:55:43,737 INFO L432 stractBuchiCegarLoop]: Abstraction has 114 states and 137 transitions. [2025-03-17 19:55:43,737 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-17 19:55:43,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 137 transitions. [2025-03-17 19:55:43,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:43,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:43,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:43,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:43,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:43,739 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1;" "strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:43,739 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:43,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash -497600731, now seen corresponding path program 1 times [2025-03-17 19:55:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:43,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041292886] [2025-03-17 19:55:43,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:43,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:43,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 19:55:43,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:55:43,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:43,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2025-03-17 19:55:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:55:43,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:43,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041292886] [2025-03-17 19:55:43,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041292886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:43,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:43,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:55:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106681984] [2025-03-17 19:55:43,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:43,967 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:43,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 7 times [2025-03-17 19:55:43,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:43,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520903518] [2025-03-17 19:55:43,967 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:55:43,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:43,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:43,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:43,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:43,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:43,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:43,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:43,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:43,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:43,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:43,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:44,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:44,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:55:44,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:55:44,054 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. cyclomatic complexity: 34 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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 19:55:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:44,091 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2025-03-17 19:55:44,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 154 transitions. [2025-03-17 19:55:44,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:44,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 127 states and 150 transitions. [2025-03-17 19:55:44,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-03-17 19:55:44,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-03-17 19:55:44,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 150 transitions. [2025-03-17 19:55:44,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:44,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 150 transitions. [2025-03-17 19:55:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 150 transitions. [2025-03-17 19:55:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2025-03-17 19:55:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 118 states have internal predecessors, (142), 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 19:55:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2025-03-17 19:55:44,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 142 transitions. [2025-03-17 19:55:44,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:55:44,097 INFO L432 stractBuchiCegarLoop]: Abstraction has 119 states and 142 transitions. [2025-03-17 19:55:44,097 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-17 19:55:44,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 142 transitions. [2025-03-17 19:55:44,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:44,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:44,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:44,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:44,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:44,098 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1;" "strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:44,098 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:44,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:44,098 INFO L85 PathProgramCache]: Analyzing trace with hash -507490299, now seen corresponding path program 1 times [2025-03-17 19:55:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760072313] [2025-03-17 19:55:44,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:44,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:44,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:55:44,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:55:44,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:44,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:55:44,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:44,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760072313] [2025-03-17 19:55:44,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760072313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:44,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106655266] [2025-03-17 19:55:44,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:44,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:44,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:44,260 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:44,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (213)] Waiting until timeout for monitored process [2025-03-17 19:55:44,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:55:44,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:55:44,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:44,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:44,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:55:44,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:55:44,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:55:44,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106655266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:44,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-17 19:55:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663405037] [2025-03-17 19:55:44,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:44,501 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 8 times [2025-03-17 19:55:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375762353] [2025-03-17 19:55:44,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:44,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:44,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:44,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:44,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:44,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:44,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:44,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:44,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:44,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:44,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:44,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 19:55:44,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:55:44,593 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. cyclomatic complexity: 34 Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 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 19:55:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:44,693 INFO L93 Difference]: Finished difference Result 143 states and 167 transitions. [2025-03-17 19:55:44,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 167 transitions. [2025-03-17 19:55:44,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:44,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 114 states and 135 transitions. [2025-03-17 19:55:44,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-03-17 19:55:44,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-03-17 19:55:44,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 135 transitions. [2025-03-17 19:55:44,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:44,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 135 transitions. [2025-03-17 19:55:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 135 transitions. [2025-03-17 19:55:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2025-03-17 19:55:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 107 states have internal predecessors, (129), 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 19:55:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2025-03-17 19:55:44,697 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-03-17 19:55:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:55:44,700 INFO L432 stractBuchiCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-03-17 19:55:44,701 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-17 19:55:44,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 129 transitions. [2025-03-17 19:55:44,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:44,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:44,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:44,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:44,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:44,701 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1;" "strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume !strstr_#t~short16#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:44,702 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:44,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:44,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1286773082, now seen corresponding path program 1 times [2025-03-17 19:55:44,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843914286] [2025-03-17 19:55:44,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:44,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 19:55:44,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:55:44,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:44,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:55:44,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843914286] [2025-03-17 19:55:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843914286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791500874] [2025-03-17 19:55:44,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:44,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:44,861 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:44,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (214)] Waiting until timeout for monitored process [2025-03-17 19:55:44,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 19:55:44,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:55:44,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:44,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:45,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 19:55:45,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:45,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-17 19:55:45,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:55:45,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 19:55:45,087 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:55:45,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:55:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:55:45,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:45,507 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 19:55:45,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 19:55:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 19:55:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791500874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:45,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:45,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 9] total 33 [2025-03-17 19:55:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458268997] [2025-03-17 19:55:45,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:45,548 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:45,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 9 times [2025-03-17 19:55:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869456374] [2025-03-17 19:55:45,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:45,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:45,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:45,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:45,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:45,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:45,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:45,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:45,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:45,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:45,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 19:55:45,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 19:55:45,635 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. cyclomatic complexity: 32 Second operand has 33 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:46,111 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2025-03-17 19:55:46,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 232 transitions. [2025-03-17 19:55:46,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 19:55:46,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 134 states and 157 transitions. [2025-03-17 19:55:46,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-03-17 19:55:46,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-03-17 19:55:46,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 157 transitions. [2025-03-17 19:55:46,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:46,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 134 states and 157 transitions. [2025-03-17 19:55:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 157 transitions. [2025-03-17 19:55:46,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2025-03-17 19:55:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 88 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2025-03-17 19:55:46,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 104 transitions. [2025-03-17 19:55:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 19:55:46,116 INFO L432 stractBuchiCegarLoop]: Abstraction has 89 states and 104 transitions. [2025-03-17 19:55:46,116 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-17 19:55:46,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 104 transitions. [2025-03-17 19:55:46,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:46,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:46,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:46,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:46,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:46,135 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1;" "strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:46,136 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:46,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash -496386742, now seen corresponding path program 2 times [2025-03-17 19:55:46,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:46,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844728448] [2025-03-17 19:55:46,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:46,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:46,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 19:55:46,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:55:46,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:46,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:55:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844728448] [2025-03-17 19:55:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844728448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195586512] [2025-03-17 19:55:46,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:46,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:46,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:46,336 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:46,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (215)] Waiting until timeout for monitored process [2025-03-17 19:55:46,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 19:55:46,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:55:46,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:46,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:46,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 19:55:46,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:55:46,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:55:46,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195586512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:46,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:46,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-03-17 19:55:46,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841480961] [2025-03-17 19:55:46,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:46,801 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:46,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 10 times [2025-03-17 19:55:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104209745] [2025-03-17 19:55:46,802 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:46,804 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-17 19:55:46,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:46,805 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:46,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:46,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:46,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:46,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:46,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:46,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:46,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:46,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 19:55:46,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-03-17 19:55:46,888 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. cyclomatic complexity: 24 Second operand has 31 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 31 states have internal predecessors, (77), 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 19:55:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:47,058 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2025-03-17 19:55:47,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 172 transitions. [2025-03-17 19:55:47,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 19:55:47,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 131 states and 153 transitions. [2025-03-17 19:55:47,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-03-17 19:55:47,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-17 19:55:47,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 153 transitions. [2025-03-17 19:55:47,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:47,059 INFO L218 hiAutomatonCegarLoop]: Abstraction has 131 states and 153 transitions. [2025-03-17 19:55:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 153 transitions. [2025-03-17 19:55:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 91. [2025-03-17 19:55:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.164835164835165) internal successors, (106), 90 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2025-03-17 19:55:47,061 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 106 transitions. [2025-03-17 19:55:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:55:47,062 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 106 transitions. [2025-03-17 19:55:47,062 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-17 19:55:47,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 106 transitions. [2025-03-17 19:55:47,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:47,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:47,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:47,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:47,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:47,063 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1;" "strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:47,064 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:47,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1948161038, now seen corresponding path program 1 times [2025-03-17 19:55:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437438840] [2025-03-17 19:55:47,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:47,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 19:55:47,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:55:47,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:47,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 19:55:47,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:47,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437438840] [2025-03-17 19:55:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437438840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52561808] [2025-03-17 19:55:47,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:47,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:47,260 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:47,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (216)] Waiting until timeout for monitored process [2025-03-17 19:55:47,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 19:55:47,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:55:47,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:47,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:47,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-17 19:55:47,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:47,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 19:55:47,463 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-17 19:55:47,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 19:55:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 19:55:47,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 19:55:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52561808] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:47,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 19:55:47,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 16 [2025-03-17 19:55:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24901857] [2025-03-17 19:55:47,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:47,571 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:55:47,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 11 times [2025-03-17 19:55:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309748185] [2025-03-17 19:55:47,571 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:55:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:47,576 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:47,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:47,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:47,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:47,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:47,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:47,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:47,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:47,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:47,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:47,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:47,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:55:47,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:55:47,660 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. cyclomatic complexity: 24 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 19:55:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:47,766 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2025-03-17 19:55:47,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 127 transitions. [2025-03-17 19:55:47,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:47,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 110 states and 127 transitions. [2025-03-17 19:55:47,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-03-17 19:55:47,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-17 19:55:47,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 127 transitions. [2025-03-17 19:55:47,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:47,767 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 127 transitions. [2025-03-17 19:55:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 127 transitions. [2025-03-17 19:55:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2025-03-17 19:55:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 96 states have internal predecessors, (112), 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 19:55:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2025-03-17 19:55:47,769 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 112 transitions. [2025-03-17 19:55:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:55:47,769 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 112 transitions. [2025-03-17 19:55:47,769 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-17 19:55:47,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 112 transitions. [2025-03-17 19:55:47,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:47,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:47,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:47,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:47,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:47,770 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~2#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume main_~i~3#1 < main_~out_len~0#1 - 1;havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1;main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" "assume !(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1;" "assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume 0 != strlen_#t~mem2#1;havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset;" "assume true;call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1);" "assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;" "strlen_#res#1 := strlen_~i~0#1;" "strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1;" "assume !(0 == strstr_~nl~0#1 % 18446744073709551616);" "assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1);" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1;" "strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1;" "assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset;strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1;" "assume 0 != strstr_~i~1#1 % 18446744073709551616;call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1;" "assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1;" [2025-03-17 19:55:47,770 INFO L754 eck$LassoCheckResult]: Loop: "assume true;memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1;" "assume 0 != memcmp_#t~pre6#1 % 18446744073709551616;havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296);" "assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset;" [2025-03-17 19:55:47,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1283468715, now seen corresponding path program 3 times [2025-03-17 19:55:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:47,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997463058] [2025-03-17 19:55:47,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:47,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:47,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-03-17 19:55:47,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 43 statements. [2025-03-17 19:55:47,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:55:47,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:55:48,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:48,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997463058] [2025-03-17 19:55:48,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997463058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:48,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133317637] [2025-03-17 19:55:48,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:48,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:48,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:48,095 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:48,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (217)] Waiting until timeout for monitored process [2025-03-17 19:55:48,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes.