./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 15:38:41,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:38:41,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:38:41,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:38:41,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:38:41,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:38:41,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:38:41,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:38:41,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:38:41,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:38:41,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:38:41,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:38:41,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:38:41,587 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:38:41,587 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:38:41,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:38:41,588 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:38:41,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:38:41,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:38:41,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:38:41,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:38:41,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:38:41,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:38:41,592 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:38:41,592 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-04 15:38:41,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:38:41,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:38:41,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:38:41,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:38:41,831 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:38:41,831 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-04 15:38:42,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f120be9a2/4bf2bd7186844cbfa9a604411fa08a2d/FLAG8c9ed504b [2025-03-04 15:38:43,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:38:43,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2025-03-04 15:38:43,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f120be9a2/4bf2bd7186844cbfa9a604411fa08a2d/FLAG8c9ed504b [2025-03-04 15:38:43,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f120be9a2/4bf2bd7186844cbfa9a604411fa08a2d [2025-03-04 15:38:43,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:38:43,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:38:43,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:38:43,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:38:43,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:38:43,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76645ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43, skipping insertion in model container [2025-03-04 15:38:43,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:38:43,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:38:43,559 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:38:43,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:38:43,609 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:38:43,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43 WrapperNode [2025-03-04 15:38:43,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:38:43,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:38:43,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:38:43,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:38:43,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,645 INFO L138 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 169 [2025-03-04 15:38:43,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:38:43,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:38:43,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:38:43,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:38:43,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,676 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-04 15:38:43,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:38:43,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:38:43,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:38:43,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:38:43,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (1/1) ... [2025-03-04 15:38:43,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:43,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:43,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:43,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:38:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:38:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:38:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:38:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:38:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:38:43,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:38:43,805 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:38:43,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:38:44,020 INFO L1325 $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-04 15:38:44,041 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-03-04 15:38:44,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:38:44,050 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:38:44,051 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:38:44,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:44 BoogieIcfgContainer [2025-03-04 15:38:44,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:38:44,052 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:38:44,052 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:38:44,055 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:38:44,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:44,056 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:38:43" (1/3) ... [2025-03-04 15:38:44,057 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd678e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:38:44, skipping insertion in model container [2025-03-04 15:38:44,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:44,057 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:43" (2/3) ... [2025-03-04 15:38:44,058 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd678e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:38:44, skipping insertion in model container [2025-03-04 15:38:44,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:44,058 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:44" (3/3) ... [2025-03-04 15:38:44,059 INFO L363 chiAutomizerObserver]: Analyzing ICFG strstr.i [2025-03-04 15:38:44,093 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:38:44,093 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:38:44,093 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:38:44,093 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:38:44,094 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:38:44,094 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:38:44,095 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:38:44,095 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:38:44,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:44,110 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-03-04 15:38:44,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:44,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:44,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:38:44,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:38:44,116 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:38:44,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:44,117 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-03-04 15:38:44,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:44,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:44,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:38:44,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:38:44,122 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-04 15:38:44,123 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-04 15:38:44,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash 109198, now seen corresponding path program 1 times [2025-03-04 15:38:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893600804] [2025-03-04 15:38:44,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:44,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:44,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:44,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:44,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:44,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:44,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:44,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:44,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:44,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:44,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2025-03-04 15:38:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739700427] [2025-03-04 15:38:44,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:44,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:38:44,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:38:44,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:44,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:44,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:44,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:38:44,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:38:44,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:44,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:44,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:44,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:44,244 INFO L85 PathProgramCache]: Analyzing trace with hash 3385211, now seen corresponding path program 1 times [2025-03-04 15:38:44,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:44,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39416000] [2025-03-04 15:38:44,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:44,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:44,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:44,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:44,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:44,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:44,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:44,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:44,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:44,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:44,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:44,478 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:44,479 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:44,479 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:44,479 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:44,479 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:44,479 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:44,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:44,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2025-03-04 15:38:44,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:44,480 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:44,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,865 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:44,867 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:44,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:38:44,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-04 15:38:44,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:44,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:44,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:44,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:38:44,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:38:44,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:44,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:44,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:44,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:38:44,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:38:44,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-04 15:38:44,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:44,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:44,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:44,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:38:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:38:44,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:44,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:44,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:44,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,960 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-04 15:38:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,962 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:38:44,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:44,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:44,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:45,006 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 15:38:45,011 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:38:45,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:45,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:45,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:45,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:38:45,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:45,028 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:45,028 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:45,029 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-04 15:38:45,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:45,044 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 15:38:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:45,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:45,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:45,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:45,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:45,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:38:45,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:38:45,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:45,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:38:45,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:45,121 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:38:45,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:45,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 52 transitions. Complement of second has 3 states. [2025-03-04 15:38:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:38:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2025-03-04 15:38:45,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-04 15:38:45,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:45,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-04 15:38:45,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:45,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-04 15:38:45,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:45,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 52 transitions. [2025-03-04 15:38:45,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-03-04 15:38:45,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 27 states and 40 transitions. [2025-03-04 15:38:45,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-04 15:38:45,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-04 15:38:45,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 40 transitions. [2025-03-04 15:38:45,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:38:45,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-03-04 15:38:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 40 transitions. [2025-03-04 15:38:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-04 15:38:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2025-03-04 15:38:45,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-03-04 15:38:45,192 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-03-04 15:38:45,192 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:38:45,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2025-03-04 15:38:45,193 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-03-04 15:38:45,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:45,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:45,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:38:45,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:38:45,194 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-04 15:38:45,194 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-04 15:38:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 104941581, now seen corresponding path program 1 times [2025-03-04 15:38:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096688024] [2025-03-04 15:38:45,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:45,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:38:45,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:38:45,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:45,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:38:45,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:38:45,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:45,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 97, now seen corresponding path program 1 times [2025-03-04 15:38:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:45,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750792968] [2025-03-04 15:38:45,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:45,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:38:45,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:38:45,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:45,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:38:45,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:38:45,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1041778219, now seen corresponding path program 1 times [2025-03-04 15:38:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:45,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437614958] [2025-03-04 15:38:45,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:45,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:45,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:45,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:45,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:45,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:45,529 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:45,529 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:45,529 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:45,529 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:45,529 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:45,529 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:45,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:45,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:45,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration2_Lasso [2025-03-04 15:38:45,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:45,530 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:45,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,624 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-04 15:38:45,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,930 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:45,930 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:45,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:45,932 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:45,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:38:45,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:45,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:45,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:45,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:45,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:45,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:45,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:45,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:45,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:45,952 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-04 15:38:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:45,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:45,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:45,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:38:45,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:45,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:45,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:45,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:45,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:45,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:45,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:45,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:45,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:45,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:38:45,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:45,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:45,978 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:45,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:38:45,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:45,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:45,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:45,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:45,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:45,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:45,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:45,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:45,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:45,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:38:45,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:45,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:45,999 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:38:46,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:46,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:46,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:46,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:38:46,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:38:46,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:46,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:46,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:46,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:46,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,042 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:38:46,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:46,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:46,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:46,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:38:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,062 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:38:46,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:46,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:46,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:46,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:46,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,084 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:38:46,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:46,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:46,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:46,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 15:38:46,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,104 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:38:46,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:46,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:46,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:46,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:46,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,127 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:38:46,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:46,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:46,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,155 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-04 15:38:46,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,159 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:38:46,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:46,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:46,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:46,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,186 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:38:46,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:46,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:46,216 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:46,231 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:38:46,231 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 15:38:46,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,233 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:38:46,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:46,247 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:46,247 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:46,247 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-04 15:38:46,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:38:46,270 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-03-04 15:38:46,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:38:46,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:38:46,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:46,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:46,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:46,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:38:46,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:38:46,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:46,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:38:46,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:46,309 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:38:46,309 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:46,316 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 28 states and 42 transitions. Complement of second has 3 states. [2025-03-04 15:38:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:38:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2025-03-04 15:38:46,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 15:38:46,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:46,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-04 15:38:46,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:46,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:38:46,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:46,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2025-03-04 15:38:46,320 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 15:38:46,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2025-03-04 15:38:46,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-04 15:38:46,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-04 15:38:46,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2025-03-04 15:38:46,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:38:46,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-03-04 15:38:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2025-03-04 15:38:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 15:38:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5) internal successors, (42), 27 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-04 15:38:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2025-03-04 15:38:46,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-03-04 15:38:46,324 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-03-04 15:38:46,325 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:38:46,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2025-03-04 15:38:46,325 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 15:38:46,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:46,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:46,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:46,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:38:46,325 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-04 15:38:46,325 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-04 15:38:46,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2064613612, now seen corresponding path program 1 times [2025-03-04 15:38:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785841069] [2025-03-04 15:38:46,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:38:46,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:38:46,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:46,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:38:46,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:38:46,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:46,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2816, now seen corresponding path program 1 times [2025-03-04 15:38:46,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902775673] [2025-03-04 15:38:46,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:46,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:46,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:46,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:46,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:46,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:46,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash -181207765, now seen corresponding path program 1 times [2025-03-04 15:38:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427264779] [2025-03-04 15:38:46,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:38:46,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:38:46,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:46,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 15:38:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:46,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427264779] [2025-03-04 15:38:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427264779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:38:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813808195] [2025-03-04 15:38:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:46,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:38:46,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:38:46,688 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:46,738 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2025-03-04 15:38:46,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2025-03-04 15:38:46,739 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 15:38:46,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 45 transitions. [2025-03-04 15:38:46,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-04 15:38:46,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-04 15:38:46,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 45 transitions. [2025-03-04 15:38:46,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:38:46,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-03-04 15:38:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 45 transitions. [2025-03-04 15:38:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-04 15:38:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2025-03-04 15:38:46,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 43 transitions. [2025-03-04 15:38:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:38:46,744 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2025-03-04 15:38:46,744 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:38:46,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2025-03-04 15:38:46,745 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 15:38:46,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:46,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:46,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:46,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:38:46,746 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-04 15:38:46,746 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-04 15:38:46,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,746 INFO L85 PathProgramCache]: Analyzing trace with hash -421486412, now seen corresponding path program 1 times [2025-03-04 15:38:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286704014] [2025-03-04 15:38:46,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:46,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:38:46,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:38:46,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:46,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:38:46,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:38:46,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:46,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2816, now seen corresponding path program 2 times [2025-03-04 15:38:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276453279] [2025-03-04 15:38:46,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:46,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:46,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:38:46,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:46,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:46,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:46,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:46,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1321514253, now seen corresponding path program 1 times [2025-03-04 15:38:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976084808] [2025-03-04 15:38:46,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:38:46,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:38:46,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:46,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:38:46,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:38:46,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:47,251 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:47,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:47,252 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:47,252 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:47,252 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:47,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,252 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:47,252 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:47,252 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration4_Lasso [2025-03-04 15:38:47,252 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:47,252 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:47,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,686 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:47,686 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:47,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,689 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 15:38:47,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-04 15:38:47,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:38:47,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,708 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:38:47,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,731 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:38:47,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,753 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:38:47,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:47,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:47,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:47,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,777 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:38:47,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:47,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,798 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:38:47,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:38:47,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,817 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:38:47,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:38:47,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,836 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 15:38:47,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,853 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-04 15:38:47,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,854 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 15:38:47,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 15:38:47,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,873 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 15:38:47,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-04 15:38:47,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:38:47,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,893 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 15:38:47,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,913 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:38:47,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 15:38:47,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,932 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:38:47,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:38:47,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,951 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 15:38:47,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:47,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,973 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:38:47,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:47,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:47,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:47,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:47,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:47,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:47,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:47,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:47,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:47,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:38:47,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:47,993 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:47,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:38:47,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:38:48,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,011 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:38:48,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,030 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-04 15:38:48,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,032 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:38:48,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,053 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 15:38:48,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,075 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 15:38:48,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,095 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-04 15:38:48,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,097 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 15:38:48,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 15:38:48,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,117 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 15:38:48,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 15:38:48,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,139 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 15:38:48,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 15:38:48,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,158 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 15:38:48,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 15:38:48,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,177 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 15:38:48,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 15:38:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,197 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 15:38:48,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,216 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 15:38:48,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-04 15:38:48,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,234 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-04 15:38:48,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,237 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 15:38:48,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:38:48,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,256 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 15:38:48,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 15:38:48,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,276 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 15:38:48,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 15:38:48,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,295 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 15:38:48,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 15:38:48,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,313 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 15:38:48,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,333 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 15:38:48,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 15:38:48,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,352 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 15:38:48,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,372 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 15:38:48,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-04 15:38:48,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,389 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-04 15:38:48,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,391 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 15:38:48,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:48,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:48,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:48,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 15:38:48,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,410 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 15:38:48,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-04 15:38:48,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,431 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 15:38:48,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 15:38:48,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,458 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 15:38:48,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,484 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-04 15:38:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,486 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 15:38:48,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,513 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 15:38:48,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,536 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 15:38:48,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,554 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,559 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-04 15:38:48,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,562 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 15:38:48,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 15:38:48,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,589 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 15:38:48,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,610 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-04 15:38:48,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,612 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 15:38:48,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-04 15:38:48,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:48,645 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:38:48,645 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 15:38:48,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,647 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 15:38:48,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:48,658 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:48,658 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:48,658 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-04 15:38:48,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 15:38:48,684 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-04 15:38:48,685 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:38:48,686 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:38:48,686 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-04 15:38:48,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:38:48,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:38:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:38:48,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:48,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:48,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:48,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:38:48,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:48,772 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-04 15:38:48,772 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 43 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:48,821 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 43 transitions. cyclomatic complexity: 17. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 52 states and 71 transitions. Complement of second has 7 states. [2025-03-04 15:38:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:38:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2025-03-04 15:38:48,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-04 15:38:48,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:48,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-04 15:38:48,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:48,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-04 15:38:48,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:48,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 71 transitions. [2025-03-04 15:38:48,824 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-03-04 15:38:48,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 49 states and 67 transitions. [2025-03-04 15:38:48,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-03-04 15:38:48,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-03-04 15:38:48,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 67 transitions. [2025-03-04 15:38:48,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:48,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-03-04 15:38:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 67 transitions. [2025-03-04 15:38:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2025-03-04 15:38:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.40625) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2025-03-04 15:38:48,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 45 transitions. [2025-03-04 15:38:48,826 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2025-03-04 15:38:48,826 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:38:48,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 45 transitions. [2025-03-04 15:38:48,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 15:38:48,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:48,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:48,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:48,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:38:48,826 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-04 15:38:48,826 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-04 15:38:48,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash -181209911, now seen corresponding path program 1 times [2025-03-04 15:38:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:48,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597769431] [2025-03-04 15:38:48,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:48,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:48,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:38:48,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:38:48,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:48,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597769431] [2025-03-04 15:38:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597769431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:48,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:38:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206360363] [2025-03-04 15:38:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:48,877 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:38:48,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 1 times [2025-03-04 15:38:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:48,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387428971] [2025-03-04 15:38:48,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:48,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:48,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:48,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:48,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:48,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:48,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:48,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:48,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:48,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:38:48,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:38:48,919 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:48,941 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2025-03-04 15:38:48,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2025-03-04 15:38:48,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 15:38:48,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 43 transitions. [2025-03-04 15:38:48,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-04 15:38:48,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-04 15:38:48,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2025-03-04 15:38:48,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:48,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-03-04 15:38:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2025-03-04 15:38:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 15:38:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-03-04 15:38:48,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-03-04 15:38:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:38:48,946 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-03-04 15:38:48,946 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:38:48,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2025-03-04 15:38:48,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 15:38:48,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:48,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:48,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:48,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:38:48,947 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-04 15:38:48,947 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-04 15:38:48,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,947 INFO L85 PathProgramCache]: Analyzing trace with hash 413386730, now seen corresponding path program 1 times [2025-03-04 15:38:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:48,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073358349] [2025-03-04 15:38:48,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:48,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:38:48,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:38:48,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:48,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:48,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:38:48,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:38:48,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:48,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 2 times [2025-03-04 15:38:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88056786] [2025-03-04 15:38:48,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:48,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:48,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:48,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:38:48,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:48,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:48,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:48,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:48,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:48,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:48,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2127657705, now seen corresponding path program 1 times [2025-03-04 15:38:48,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:48,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465274468] [2025-03-04 15:38:48,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:48,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:48,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:48,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:48,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:49,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 15:38:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465274468] [2025-03-04 15:38:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465274468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:38:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902483744] [2025-03-04 15:38:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:49,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:38:49,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:38:49,225 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-04 15:38:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:49,324 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2025-03-04 15:38:49,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2025-03-04 15:38:49,325 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 15:38:49,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 79 transitions. [2025-03-04 15:38:49,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-03-04 15:38:49,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-04 15:38:49,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2025-03-04 15:38:49,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:49,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-03-04 15:38:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2025-03-04 15:38:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2025-03-04 15:38:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2025-03-04 15:38:49,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-03-04 15:38:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:38:49,329 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-03-04 15:38:49,329 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:38:49,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 63 transitions. [2025-03-04 15:38:49,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 15:38:49,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:49,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:49,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:49,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:38:49,330 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-04 15:38:49,330 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-04 15:38:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 854263197, now seen corresponding path program 1 times [2025-03-04 15:38:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:49,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053691636] [2025-03-04 15:38:49,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:49,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:38:49,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:38:49,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:49,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:49,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:38:49,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:38:49,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:49,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:49,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:49,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 3 times [2025-03-04 15:38:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558017045] [2025-03-04 15:38:49,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:38:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:49,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:49,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:49,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:38:49,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:49,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:49,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:49,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:49,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:49,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:49,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:49,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash 608180188, now seen corresponding path program 1 times [2025-03-04 15:38:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:49,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603563136] [2025-03-04 15:38:49,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:49,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:49,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:38:49,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:38:49,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:49,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:49,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:38:49,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:38:49,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:49,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:49,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:50,168 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:50,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:50,168 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:50,168 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:50,168 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:50,168 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,168 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:50,168 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:50,168 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2025-03-04 15:38:50,168 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:50,168 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:50,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:50,617 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:50,617 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:50,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,620 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 15:38:50,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-04 15:38:50,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 15:38:50,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,641 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 15:38:50,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-04 15:38:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,661 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 15:38:50,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 15:38:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,680 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 15:38:50,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:50,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,699 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-04 15:38:50,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-04 15:38:50,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,718 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-04 15:38:50,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-04 15:38:50,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,738 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 15:38:50,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 15:38:50,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,757 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 15:38:50,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-04 15:38:50,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-04 15:38:50,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,775 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 15:38:50,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-04 15:38:50,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-04 15:38:50,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,795 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-04 15:38:50,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-04 15:38:50,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,814 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-04 15:38:50,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-04 15:38:50,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,833 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-04 15:38:50,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-04 15:38:50,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,853 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-04 15:38:50,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 15:38:50,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,873 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-04 15:38:50,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:50,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,894 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-04 15:38:50,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-04 15:38:50,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,913 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-04 15:38:50,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-04 15:38:50,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,932 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-04 15:38:50,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:50,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:50,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:50,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-04 15:38:50,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,951 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-04 15:38:50,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:50,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:50,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-04 15:38:50,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:50,972 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:50,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-04 15:38:50,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:50,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:50,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:50,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:50,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:50,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:50,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:50,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:50,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-04 15:38:50,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:50,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:51,000 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:51,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-04 15:38:51,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:51,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:51,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:51,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:51,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:51,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:51,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:51,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:51,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:51,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:51,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:51,021 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:51,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-04 15:38:51,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:51,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:51,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:51,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:51,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:51,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:51,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:51,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:51,049 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-04 15:38:51,049 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:38:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:51,051 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:51,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-04 15:38:51,053 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:51,064 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 15:38:51,064 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:51,064 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-04 15:38:51,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:51,091 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-04 15:38:51,092 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-04 15:38:51,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:51,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:38:51,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:38:51,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:51,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:51,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:38:51,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:51,157 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 1 [2025-03-04 15:38:51,217 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:38:51,217 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-04 15:38:51,223 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-04 15:38:51,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:51,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:51,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:51,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:51,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:38:51,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:51,288 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-04 15:38:51,288 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 63 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:51,469 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 63 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 93 states and 124 transitions. Complement of second has 12 states. [2025-03-04 15:38:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-04 15:38:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2025-03-04 15:38:51,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 63 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-04 15:38:51,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:51,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 63 transitions. Stem has 15 letters. Loop has 2 letters. [2025-03-04 15:38:51,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:51,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 63 transitions. Stem has 13 letters. Loop has 4 letters. [2025-03-04 15:38:51,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:51,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 124 transitions. [2025-03-04 15:38:51,475 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2025-03-04 15:38:51,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 91 states and 122 transitions. [2025-03-04 15:38:51,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2025-03-04 15:38:51,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-03-04 15:38:51,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2025-03-04 15:38:51,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:51,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2025-03-04 15:38:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2025-03-04 15:38:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2025-03-04 15:38:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.375) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2025-03-04 15:38:51,479 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 88 transitions. [2025-03-04 15:38:51,479 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2025-03-04 15:38:51,479 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:38:51,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2025-03-04 15:38:51,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 15:38:51,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:51,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:51,480 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:51,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:38:51,481 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-04 15:38:51,481 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-04 15:38:51,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1636531786, now seen corresponding path program 2 times [2025-03-04 15:38:51,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:51,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565731581] [2025-03-04 15:38:51,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:51,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:38:51,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:51,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:38:51,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:51,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:51,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:51,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:51,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:51,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:51,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:51,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 4 times [2025-03-04 15:38:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976438271] [2025-03-04 15:38:51,513 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:38:51,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:51,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:38:51,520 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:51,520 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:38:51,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:51,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:51,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:51,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:51,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:51,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:51,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash 749017417, now seen corresponding path program 2 times [2025-03-04 15:38:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:51,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90352460] [2025-03-04 15:38:51,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:51,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:51,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:38:51,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:38:51,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:38:51,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:51,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:51,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:38:51,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:38:51,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:51,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:51,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:51,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:52,582 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:52,582 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:52,582 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:52,582 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:52,582 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:52,582 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:52,582 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:52,582 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:52,582 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration8_Lasso [2025-03-04 15:38:52,582 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:52,582 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:52,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:52,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:53,030 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:53,030 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:53,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,033 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-04 15:38:53,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-04 15:38:53,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,052 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-04 15:38:53,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-04 15:38:53,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,071 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-04 15:38:53,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-04 15:38:53,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,090 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-04 15:38:53,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-04 15:38:53,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,109 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-04 15:38:53,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-04 15:38:53,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,127 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-04 15:38:53,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-04 15:38:53,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,150 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-04 15:38:53,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:53,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,168 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-04 15:38:53,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-04 15:38:53,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-04 15:38:53,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,188 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-04 15:38:53,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-04 15:38:53,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,207 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-04 15:38:53,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-04 15:38:53,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,225 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-04 15:38:53,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:53,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,249 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-04 15:38:53,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-04 15:38:53,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,267 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-04 15:38:53,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-04 15:38:53,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,286 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-04 15:38:53,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-04 15:38:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,306 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-04 15:38:53,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-04 15:38:53,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,326 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-04 15:38:53,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:53,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,345 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-04 15:38:53,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-04 15:38:53,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,364 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-04 15:38:53,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-04 15:38:53,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,383 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-04 15:38:53,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-03-04 15:38:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,402 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-04 15:38:53,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-03-04 15:38:53,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,421 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-04 15:38:53,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-04 15:38:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,439 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-04 15:38:53,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:53,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:53,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-04 15:38:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,461 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-04 15:38:53,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:53,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:53,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:53,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,482 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-04 15:38:53,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:53,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:53,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-04 15:38:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,502 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-04 15:38:53,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,521 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:38:53,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,522 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-04 15:38:53,523 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:38:53,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-04 15:38:53,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,536 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-04 15:38:53,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:53,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:53,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:53,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-04 15:38:53,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,554 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-04 15:38:53,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:53,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:53,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,578 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:53,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-04 15:38:53,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:53,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:53,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,597 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-04 15:38:53,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,599 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-04 15:38:53,599 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-04 15:38:53,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:53,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:53,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,622 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-04 15:38:53,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,624 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-04 15:38:53,625 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-04 15:38:53,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:53,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:53,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:53,643 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-04 15:38:53,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,645 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-04 15:38:53,645 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-04 15:38:53,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:53,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:53,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:53,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:53,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:53,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:53,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:53,663 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:53,674 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:38:53,674 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 15:38:53,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:53,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:53,676 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-04 15:38:53,677 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-04 15:38:53,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:53,687 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:53,687 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:53,687 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_5, ULTIMATE.start_strlen_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_5 - 1*ULTIMATE.start_strlen_~s#1.offset Supporting invariants [] [2025-03-04 15:38:53,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-04 15:38:53,709 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-03-04 15:38:53,711 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-04 15:38:53,711 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:38:53,711 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:38:53,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:53,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:53,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:53,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:53,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:53,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:38:53,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:53,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:38:53,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:38:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:53,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:38:53,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:53,813 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-04 15:38:53,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 88 transitions. cyclomatic complexity: 34 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:53,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 88 transitions. cyclomatic complexity: 34. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 81 states and 113 transitions. Complement of second has 8 states. [2025-03-04 15:38:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:38:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2025-03-04 15:38:53,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-04 15:38:53,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:53,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-04 15:38:53,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:53,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 14 letters. Loop has 4 letters. [2025-03-04 15:38:53,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:53,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 113 transitions. [2025-03-04 15:38:53,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-03-04 15:38:53,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 77 states and 105 transitions. [2025-03-04 15:38:53,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2025-03-04 15:38:53,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-03-04 15:38:53,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 105 transitions. [2025-03-04 15:38:53,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:53,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 105 transitions. [2025-03-04 15:38:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 105 transitions. [2025-03-04 15:38:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2025-03-04 15:38:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2025-03-04 15:38:53,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-03-04 15:38:53,875 INFO L432 stractBuchiCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-03-04 15:38:53,875 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:38:53,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 65 transitions. [2025-03-04 15:38:53,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:38:53,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:53,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:53,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:53,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:53,876 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-04 15:38:53,876 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-04 15:38:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1532812922, now seen corresponding path program 1 times [2025-03-04 15:38:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822232318] [2025-03-04 15:38:53,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:53,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:38:53,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:38:53,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:53,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822232318] [2025-03-04 15:38:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822232318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:53,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:38:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981899596] [2025-03-04 15:38:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:53,917 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:38:53,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash 57547, now seen corresponding path program 1 times [2025-03-04 15:38:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055380548] [2025-03-04 15:38:53,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:53,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:53,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:53,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:53,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:53,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:53,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:53,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:53,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:53,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:53,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:54,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:38:54,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:38:54,002 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. cyclomatic complexity: 24 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:54,031 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2025-03-04 15:38:54,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 63 transitions. [2025-03-04 15:38:54,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:38:54,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 63 transitions. [2025-03-04 15:38:54,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-04 15:38:54,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-04 15:38:54,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 63 transitions. [2025-03-04 15:38:54,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:54,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 63 transitions. [2025-03-04 15:38:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 63 transitions. [2025-03-04 15:38:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 15:38:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3125) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2025-03-04 15:38:54,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 63 transitions. [2025-03-04 15:38:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:38:54,037 INFO L432 stractBuchiCegarLoop]: Abstraction has 48 states and 63 transitions. [2025-03-04 15:38:54,037 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:38:54,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 63 transitions. [2025-03-04 15:38:54,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:38:54,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:54,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:54,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:54,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:54,039 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-04 15:38:54,039 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-04 15:38:54,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1918636227, now seen corresponding path program 1 times [2025-03-04 15:38:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395087966] [2025-03-04 15:38:54,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:54,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:38:54,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:38:54,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:54,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:54,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395087966] [2025-03-04 15:38:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395087966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:38:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232940019] [2025-03-04 15:38:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:54,100 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:38:54,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash 57547, now seen corresponding path program 2 times [2025-03-04 15:38:54,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:54,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740077211] [2025-03-04 15:38:54,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:54,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:54,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:54,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:54,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:38:54,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:54,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:54,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:54,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:54,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:54,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:54,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:54,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:38:54,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:38:54,194 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:54,221 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2025-03-04 15:38:54,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 90 transitions. [2025-03-04 15:38:54,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:38:54,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 61 transitions. [2025-03-04 15:38:54,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-04 15:38:54,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-04 15:38:54,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2025-03-04 15:38:54,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:54,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-04 15:38:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2025-03-04 15:38:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2025-03-04 15:38:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.25) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-04 15:38:54,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-04 15:38:54,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:38:54,224 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-04 15:38:54,224 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:38:54,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2025-03-04 15:38:54,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:38:54,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:54,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:54,224 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, 1] [2025-03-04 15:38:54,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:54,224 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-04 15:38:54,224 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-04 15:38:54,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:54,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1515615140, now seen corresponding path program 1 times [2025-03-04 15:38:54,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:54,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7013127] [2025-03-04 15:38:54,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:54,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:54,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:38:54,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:38:54,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:54,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:54,408 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-04 15:38:54,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:54,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7013127] [2025-03-04 15:38:54,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7013127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:38:54,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619927193] [2025-03-04 15:38:54,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:38:54,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:54,410 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:38:54,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-03-04 15:38:54,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:38:54,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:38:54,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:54,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:54,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 15:38:54,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:54,490 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-04 15:38:54,660 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-04 15:38:54,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:38:54,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-04 15:38:54,864 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-04 15:38:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619927193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:38:54,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:38:54,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 28 [2025-03-04 15:38:54,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958190386] [2025-03-04 15:38:54,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:38:54,865 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:38:54,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash 57547, now seen corresponding path program 3 times [2025-03-04 15:38:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743678426] [2025-03-04 15:38:54,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:38:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:54,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:54,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:54,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:38:54,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:54,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:54,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:54,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:54,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:54,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:54,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:54,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:38:54,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-03-04 15:38:54,943 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 18 Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 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-04 15:38:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:55,471 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2025-03-04 15:38:55,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 195 transitions. [2025-03-04 15:38:55,472 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2025-03-04 15:38:55,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 139 states and 170 transitions. [2025-03-04 15:38:55,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-03-04 15:38:55,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-03-04 15:38:55,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2025-03-04 15:38:55,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:55,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 170 transitions. [2025-03-04 15:38:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2025-03-04 15:38:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 61. [2025-03-04 15:38:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-03-04 15:38:55,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-04 15:38:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 15:38:55,481 INFO L432 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-04 15:38:55,481 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:38:55,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2025-03-04 15:38:55,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:38:55,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:55,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:55,481 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] [2025-03-04 15:38:55,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:55,482 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-04 15:38:55,482 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-04 15:38:55,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1478854216, now seen corresponding path program 1 times [2025-03-04 15:38:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702551385] [2025-03-04 15:38:55,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:55,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:38:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:38:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:55,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:55,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:38:55,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:38:55,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:55,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:55,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:55,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash 57547, now seen corresponding path program 4 times [2025-03-04 15:38:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845715684] [2025-03-04 15:38:55,519 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:38:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:55,521 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:38:55,522 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:55,522 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:38:55,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:55,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:55,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:55,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:55,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:55,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:55,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:55,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1228545756, now seen corresponding path program 1 times [2025-03-04 15:38:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159274353] [2025-03-04 15:38:55,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:55,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:38:55,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:38:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:55,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:55,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:38:55,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:38:55,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:55,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:55,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:56,990 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:56,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:56,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:56,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:56,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:56,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:56,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:56,991 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:56,991 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration12_Lasso [2025-03-04 15:38:56,991 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:56,991 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:56,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:56,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:56,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:56,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:56,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:56,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:57,524 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:57,525 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:57,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,526 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-04 15:38:57,527 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-04 15:38:57,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:57,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:57,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:57,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:57,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,544 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-04 15:38:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,546 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-04 15:38:57,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-04 15:38:57,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:57,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:57,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:57,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:57,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,566 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-04 15:38:57,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,567 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-04 15:38:57,568 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-04 15:38:57,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:57,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:57,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:57,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:57,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,587 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-04 15:38:57,587 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-04 15:38:57,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:57,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:57,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:57,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:57,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,605 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-04 15:38:57,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,607 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-04 15:38:57,608 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-04 15:38:57,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:57,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:57,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:57,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:57,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:57,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,627 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-04 15:38:57,628 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-04 15:38:57,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:57,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:57,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:57,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:57,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,645 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-04 15:38:57,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,647 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-04 15:38:57,647 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-04 15:38:57,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-04 15:38:57,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:57,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:57,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:57,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,672 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-04 15:38:57,673 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-04 15:38:57,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:57,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:57,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:57,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,692 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-04 15:38:57,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,694 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-04 15:38:57,694 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-04 15:38:57,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-04 15:38:57,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,706 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-03-04 15:38:57,706 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:38:57,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,713 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2025-03-04 15:38:57,713 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:38:57,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:57,732 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-04 15:38:57,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,734 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-04 15:38:57,734 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-04 15:38:57,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:57,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:57,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:57,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:57,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:57,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:57,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:57,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:57,778 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:38:57,778 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:38:57,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:57,780 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-04 15:38:57,781 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-04 15:38:57,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:57,793 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 15:38:57,793 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:57,793 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack#1.offset) = -2*ULTIMATE.start_strstr_~haystack#1.offset + 36893488147419103229 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_6 + 18446744073709551615 >= 0] [2025-03-04 15:38:57,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:57,840 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-04 15:38:57,842 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-04 15:38:57,844 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~haystack!offset [2025-03-04 15:38:57,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:57,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:38:57,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:38:57,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:57,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:57,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 15:38:57,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:57,896 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 1 [2025-03-04 15:38:57,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:38:57,931 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-04 15:38:57,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:38:57,935 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-04 15:38:58,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:58,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:58,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:58,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:58,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:38:58,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:58,084 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-04 15:38:58,084 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 21 Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:58,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 21. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 69 states and 87 transitions. Complement of second has 6 states. [2025-03-04 15:38:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:38:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2025-03-04 15:38:58,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 24 letters. Loop has 3 letters. [2025-03-04 15:38:58,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:58,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 27 letters. Loop has 3 letters. [2025-03-04 15:38:58,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:58,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 24 letters. Loop has 6 letters. [2025-03-04 15:38:58,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:58,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2025-03-04 15:38:58,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:58,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 66 states and 82 transitions. [2025-03-04 15:38:58,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-04 15:38:58,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-04 15:38:58,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 82 transitions. [2025-03-04 15:38:58,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:58,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-04 15:38:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 82 transitions. [2025-03-04 15:38:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 15:38:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 65 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-04 15:38:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-03-04 15:38:58,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-04 15:38:58,137 INFO L432 stractBuchiCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-04 15:38:58,137 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 15:38:58,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 82 transitions. [2025-03-04 15:38:58,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:58,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:58,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:58,137 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, 1] [2025-03-04 15:38:58,137 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:58,137 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-04 15:38:58,141 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-04 15:38:58,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash -455272506, now seen corresponding path program 1 times [2025-03-04 15:38:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:58,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659639329] [2025-03-04 15:38:58,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:58,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:38:58,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:38:58,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:58,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:58,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:58,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:38:58,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:38:58,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:58,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:58,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 1 times [2025-03-04 15:38:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680568376] [2025-03-04 15:38:58,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:58,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:58,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:58,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:58,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:58,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:58,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:58,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:58,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:58,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:58,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:58,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash 483518318, now seen corresponding path program 1 times [2025-03-04 15:38:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:58,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798833421] [2025-03-04 15:38:58,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:58,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 15:38:58,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:38:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:58,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:58,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 15:38:58,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:38:58,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:58,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:58,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:00,862 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:00,862 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:00,862 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:00,862 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:00,862 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:00,862 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:00,862 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:00,862 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:00,862 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration13_Lasso [2025-03-04 15:39:00,862 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:00,862 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:00,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:00,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:01,711 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:01,711 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:01,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,713 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-04 15:39:01,713 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-04 15:39:01,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,730 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-04 15:39:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,732 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-04 15:39:01,733 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-04 15:39:01,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,750 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-04 15:39:01,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,752 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-04 15:39:01,752 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-04 15:39:01,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:01,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:01,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,771 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-04 15:39:01,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,796 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-04 15:39:01,796 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-04 15:39:01,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-04 15:39:01,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,815 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-04 15:39:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,817 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-04 15:39:01,817 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-04 15:39:01,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,834 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-04 15:39:01,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,836 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-04 15:39:01,837 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-04 15:39:01,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,854 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-04 15:39:01,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,856 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-04 15:39:01,857 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-04 15:39:01,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:01,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,875 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-04 15:39:01,876 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-04 15:39:01,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,893 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-04 15:39:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,895 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-04 15:39:01,906 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-04 15:39:01,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,922 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-04 15:39:01,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,924 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-04 15:39:01,925 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-04 15:39:01,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,943 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-04 15:39:01,944 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-04 15:39:01,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:01,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,962 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-04 15:39:01,963 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-04 15:39:01,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:01,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:01,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-04 15:39:01,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:01,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-04 15:39:01,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-04 15:39:01,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-04 15:39:01,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:01,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:01,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:01,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:01,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:01,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:01,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:01,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:02,003 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-04 15:39:02,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:02,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:02,006 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-04 15:39:02,006 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-04 15:39:02,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:02,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:02,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:02,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:02,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:02,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:02,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:02,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:02,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:02,023 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-04 15:39:02,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:02,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:02,025 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-04 15:39:02,026 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-04 15:39:02,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:02,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:02,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:02,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:02,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:02,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:02,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:02,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:02,047 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-04 15:39:02,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:02,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:02,049 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-04 15:39:02,049 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-04 15:39:02,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:02,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:02,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:02,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:02,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:02,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:02,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:02,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:02,068 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-04 15:39:02,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:02,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:02,070 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-04 15:39:02,070 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-04 15:39:02,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-04 15:39:02,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:02,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:02,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:02,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:02,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:02,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:02,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:02,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-04 15:39:02,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:02,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:02,093 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-04 15:39:02,093 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-04 15:39:02,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-04 15:39:02,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:02,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:02,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:02,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:02,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:02,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:02,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:02,181 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2025-03-04 15:39:02,181 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 21 variables to zero. [2025-03-04 15:39:02,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:02,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:02,183 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-04 15:39:02,184 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-04 15:39:02,185 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:02,195 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:39:02,195 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:02,195 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_6, ULTIMATE.start_memcmp_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_6 - 1*ULTIMATE.start_memcmp_~s~0#1.offset Supporting invariants [] [2025-03-04 15:39:02,201 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-04 15:39:02,250 INFO L156 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2025-03-04 15:39:02,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-04 15:39:02,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:39:02,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:39:02,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:02,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:39:02,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:39:02,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:02,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:02,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:39:02,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:02,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:02,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:02,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:02,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:02,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:39:02,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:39:02,388 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-04 15:39:02,388 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 82 transitions. cyclomatic complexity: 24 Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:02,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 82 transitions. cyclomatic complexity: 24. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 108 transitions. Complement of second has 9 states. [2025-03-04 15:39:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:39:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2025-03-04 15:39:02,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 26 letters. Loop has 3 letters. [2025-03-04 15:39:02,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:02,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 29 letters. Loop has 3 letters. [2025-03-04 15:39:02,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:02,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 26 letters. Loop has 6 letters. [2025-03-04 15:39:02,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:02,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 108 transitions. [2025-03-04 15:39:02,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:02,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 95 transitions. [2025-03-04 15:39:02,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-04 15:39:02,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-04 15:39:02,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 95 transitions. [2025-03-04 15:39:02,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:02,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 95 transitions. [2025-03-04 15:39:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 95 transitions. [2025-03-04 15:39:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-04 15:39:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 73 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2025-03-04 15:39:02,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-03-04 15:39:02,430 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-03-04 15:39:02,430 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 15:39:02,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 92 transitions. [2025-03-04 15:39:02,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:02,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:02,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:02,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1] [2025-03-04 15:39:02,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:02,431 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;" "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-04 15:39:02,432 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-04 15:39:02,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash 127849351, now seen corresponding path program 1 times [2025-03-04 15:39:02,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:02,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888264588] [2025-03-04 15:39:02,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:02,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:39:02,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:39:02,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:02,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:39:02,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888264588] [2025-03-04 15:39:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888264588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:02,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:02,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:39:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300273825] [2025-03-04 15:39:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:02,484 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:02,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 2 times [2025-03-04 15:39:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:02,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100245758] [2025-03-04 15:39:02,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:02,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:02,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:02,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:02,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:02,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:02,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:02,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:02,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:02,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:02,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:02,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:02,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:39:02,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:39:02,577 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:02,587 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-03-04 15:39:02,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 93 transitions. [2025-03-04 15:39:02,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:02,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 89 transitions. [2025-03-04 15:39:02,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-04 15:39:02,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-04 15:39:02,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 89 transitions. [2025-03-04 15:39:02,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:02,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 89 transitions. [2025-03-04 15:39:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 89 transitions. [2025-03-04 15:39:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 15:39:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 72 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-04 15:39:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2025-03-04 15:39:02,593 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 89 transitions. [2025-03-04 15:39:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:39:02,594 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 89 transitions. [2025-03-04 15:39:02,594 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 15:39:02,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 89 transitions. [2025-03-04 15:39:02,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:02,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:02,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:02,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1] [2025-03-04 15:39:02,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:02,594 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;" "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-04 15:39:02,597 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-04 15:39:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash 159249065, now seen corresponding path program 1 times [2025-03-04 15:39:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997942075] [2025-03-04 15:39:02,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:39:02,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:39:02,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:02,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:02,806 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-04 15:39:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997942075] [2025-03-04 15:39:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997942075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779454778] [2025-03-04 15:39:02,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:02,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:02,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:02,808 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:02,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2025-03-04 15:39:02,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:39:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:39:02,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:02,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:02,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 15:39:02,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:02,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:39:02,931 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 14 treesize of output 10 [2025-03-04 15:39:03,005 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-04 15:39:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:39:03,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:39:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779454778] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:39:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 8] total 22 [2025-03-04 15:39:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122789185] [2025-03-04 15:39:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:03,240 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:03,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 3 times [2025-03-04 15:39:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:03,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638808085] [2025-03-04 15:39:03,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:39:03,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:03,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:03,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:03,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:39:03,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:03,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:03,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:03,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:03,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:03,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:03,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:03,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:39:03,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2025-03-04 15:39:03,333 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. cyclomatic complexity: 26 Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:03,413 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2025-03-04 15:39:03,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 101 transitions. [2025-03-04 15:39:03,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:03,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 83 states and 99 transitions. [2025-03-04 15:39:03,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-04 15:39:03,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-04 15:39:03,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 99 transitions. [2025-03-04 15:39:03,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:03,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-04 15:39:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 99 transitions. [2025-03-04 15:39:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2025-03-04 15:39:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2025-03-04 15:39:03,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 93 transitions. [2025-03-04 15:39:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:39:03,417 INFO L432 stractBuchiCegarLoop]: Abstraction has 77 states and 93 transitions. [2025-03-04 15:39:03,417 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 15:39:03,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 93 transitions. [2025-03-04 15:39:03,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:03,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:03,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:03,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1, 1] [2025-03-04 15:39:03,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:03,418 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;" "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-04 15:39:03,418 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-04 15:39:03,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash -166218239, now seen corresponding path program 1 times [2025-03-04 15:39:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:03,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692806451] [2025-03-04 15:39:03,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:03,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:39:03,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:39:03,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:03,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:39:03,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692806451] [2025-03-04 15:39:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692806451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063254513] [2025-03-04 15:39:03,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:03,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:03,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:03,566 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:03,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2025-03-04 15:39:03,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:39:03,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:39:03,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:03,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:03,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-04 15:39:03,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:03,710 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-04 15:39:03,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:39:03,731 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-04 15:39:03,746 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-04 15:39:03,755 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-04 15:39:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:39:03,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:16,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:39:16,282 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-04 15:39:16,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:39:16,297 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-04 15:39:16,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:39:16,313 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-04 15:39:16,448 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:39:16,448 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-04 15:39:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:39:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063254513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:16,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:16,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 26 [2025-03-04 15:39:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566162726] [2025-03-04 15:39:16,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:16,452 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:16,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 4 times [2025-03-04 15:39:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:16,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114946417] [2025-03-04 15:39:16,452 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:39:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:16,455 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:39:16,456 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:16,456 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:39:16,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:16,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:16,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:16,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:16,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:16,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:16,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:16,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:39:16,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=582, Unknown=4, NotChecked=0, Total=650 [2025-03-04 15:39:16,675 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. cyclomatic complexity: 26 Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:18,688 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2025-03-04 15:39:18,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 233 transitions. [2025-03-04 15:39:18,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:18,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 142 states and 168 transitions. [2025-03-04 15:39:18,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-04 15:39:18,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-04 15:39:18,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 168 transitions. [2025-03-04 15:39:18,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:18,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 168 transitions. [2025-03-04 15:39:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 168 transitions. [2025-03-04 15:39:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2025-03-04 15:39:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.1951219512195121) internal successors, (147), 122 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2025-03-04 15:39:18,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 147 transitions. [2025-03-04 15:39:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 15:39:18,695 INFO L432 stractBuchiCegarLoop]: Abstraction has 123 states and 147 transitions. [2025-03-04 15:39:18,695 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-04 15:39:18,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 147 transitions. [2025-03-04 15:39:18,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:18,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:18,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:18,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 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-04 15:39:18,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:18,696 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 { :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-04 15:39:18,697 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-04 15:39:18,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2035613384, now seen corresponding path program 1 times [2025-03-04 15:39:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141942298] [2025-03-04 15:39:18,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:18,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:18,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:39:18,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:39:18,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:18,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:39:18,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141942298] [2025-03-04 15:39:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141942298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217027134] [2025-03-04 15:39:18,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:18,996 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:18,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2025-03-04 15:39:19,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:39:19,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:39:19,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:19,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:19,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 15:39:19,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:19,152 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-04 15:39:19,230 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 9 treesize of output 3 [2025-03-04 15:39:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:39:19,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:19,390 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-04 15:39:19,399 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-04 15:39:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:39:19,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217027134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:19,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-04 15:39:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349642694] [2025-03-04 15:39:19,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:19,468 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:19,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 5 times [2025-03-04 15:39:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:19,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241523290] [2025-03-04 15:39:19,469 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:39:19,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:19,474 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:19,476 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:19,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:19,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:19,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:19,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:19,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:19,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:19,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:19,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:19,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:19,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:39:19,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:39:19,698 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. cyclomatic complexity: 38 Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:20,150 INFO L93 Difference]: Finished difference Result 160 states and 184 transitions. [2025-03-04 15:39:20,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 184 transitions. [2025-03-04 15:39:20,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:20,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 145 states and 169 transitions. [2025-03-04 15:39:20,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-03-04 15:39:20,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-03-04 15:39:20,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 169 transitions. [2025-03-04 15:39:20,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:20,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 169 transitions. [2025-03-04 15:39:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 169 transitions. [2025-03-04 15:39:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2025-03-04 15:39:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.1726618705035972) internal successors, (163), 138 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2025-03-04 15:39:20,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 139 states and 163 transitions. [2025-03-04 15:39:20,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:39:20,156 INFO L432 stractBuchiCegarLoop]: Abstraction has 139 states and 163 transitions. [2025-03-04 15:39:20,156 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-04 15:39:20,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 163 transitions. [2025-03-04 15:39:20,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:20,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:20,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:20,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1] [2025-03-04 15:39:20,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:20,157 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_#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-04 15:39:20,157 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-04 15:39:20,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1887200157, now seen corresponding path program 2 times [2025-03-04 15:39:20,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:20,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330708337] [2025-03-04 15:39:20,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:20,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:20,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-04 15:39:20,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:39:20,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:39:20,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:39:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330708337] [2025-03-04 15:39:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330708337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30633556] [2025-03-04 15:39:20,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:20,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:20,595 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:20,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2025-03-04 15:39:20,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-04 15:39:20,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:39:20,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:39:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:20,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-04 15:39:20,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:20,801 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-04 15:39:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:39:21,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:21,659 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 28 treesize of output 22 [2025-03-04 15:39:21,686 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-04 15:39:21,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 49 [2025-03-04 15:39:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:39:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30633556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:21,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:21,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 32 [2025-03-04 15:39:21,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684080094] [2025-03-04 15:39:21,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:21,743 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 6 times [2025-03-04 15:39:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855458140] [2025-03-04 15:39:21,743 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:39:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:21,746 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:21,748 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:21,748 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:39:21,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:21,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:21,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:21,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:21,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:21,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:21,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:21,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 15:39:21,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2025-03-04 15:39:21,916 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. cyclomatic complexity: 38 Second operand has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:23,194 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2025-03-04 15:39:23,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 332 transitions. [2025-03-04 15:39:23,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:39:23,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 278 states and 321 transitions. [2025-03-04 15:39:23,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-03-04 15:39:23,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-03-04 15:39:23,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 321 transitions. [2025-03-04 15:39:23,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:23,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 278 states and 321 transitions. [2025-03-04 15:39:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 321 transitions. [2025-03-04 15:39:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 155. [2025-03-04 15:39:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 155 states have (on average 1.1612903225806452) internal successors, (180), 154 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2025-03-04 15:39:23,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155 states and 180 transitions. [2025-03-04 15:39:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 15:39:23,201 INFO L432 stractBuchiCegarLoop]: Abstraction has 155 states and 180 transitions. [2025-03-04 15:39:23,201 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-04 15:39:23,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 180 transitions. [2025-03-04 15:39:23,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:23,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:23,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:23,202 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, 1] [2025-03-04 15:39:23,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:23,204 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-04 15:39:23,204 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-04 15:39:23,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash 266768540, now seen corresponding path program 3 times [2025-03-04 15:39:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586912765] [2025-03-04 15:39:23,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:39:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:23,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-03-04 15:39:23,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:39:23,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:39:23,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:23,519 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-04 15:39:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586912765] [2025-03-04 15:39:23,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586912765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596504689] [2025-03-04 15:39:23,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:39:23,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:23,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:23,522 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:23,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2025-03-04 15:39:23,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-03-04 15:39:23,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:39:23,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:39:23,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:23,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:39:23,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:23,878 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-04 15:39:23,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:24,460 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-04 15:39:24,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596504689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:24,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:24,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-03-04 15:39:24,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291576421] [2025-03-04 15:39:24,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:24,461 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:24,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 7 times [2025-03-04 15:39:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827149248] [2025-03-04 15:39:24,461 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:39:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:24,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:24,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:24,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:24,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:24,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:24,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:24,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:24,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:24,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:24,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:24,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 15:39:24,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-03-04 15:39:24,646 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. cyclomatic complexity: 39 Second operand has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:25,182 INFO L93 Difference]: Finished difference Result 266 states and 305 transitions. [2025-03-04 15:39:25,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 305 transitions. [2025-03-04 15:39:25,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:39:25,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 230 states and 267 transitions. [2025-03-04 15:39:25,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2025-03-04 15:39:25,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2025-03-04 15:39:25,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 267 transitions. [2025-03-04 15:39:25,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:25,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 267 transitions. [2025-03-04 15:39:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 267 transitions. [2025-03-04 15:39:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 159. [2025-03-04 15:39:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.1572327044025157) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2025-03-04 15:39:25,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 159 states and 184 transitions. [2025-03-04 15:39:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:39:25,188 INFO L432 stractBuchiCegarLoop]: Abstraction has 159 states and 184 transitions. [2025-03-04 15:39:25,188 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-04 15:39:25,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 184 transitions. [2025-03-04 15:39:25,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:25,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:25,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:25,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 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] [2025-03-04 15:39:25,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:25,189 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_#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;" "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-04 15:39:25,189 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-04 15:39:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 102696830, now seen corresponding path program 1 times [2025-03-04 15:39:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:25,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306543482] [2025-03-04 15:39:25,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:39:25,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:39:25,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:25,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:39:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306543482] [2025-03-04 15:39:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306543482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132188651] [2025-03-04 15:39:25,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:25,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:25,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:25,664 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:25,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2025-03-04 15:39:25,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:39:25,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:39:25,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:25,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:25,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 15:39:25,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:25,858 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-04 15:39:25,950 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 7 treesize of output 3 [2025-03-04 15:39:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:39:25,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:26,000 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-04 15:39:26,004 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-04 15:39:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:39:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132188651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:26,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2025-03-04 15:39:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925807159] [2025-03-04 15:39:26,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:26,051 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:26,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 8 times [2025-03-04 15:39:26,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:26,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948919144] [2025-03-04 15:39:26,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:26,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:26,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:26,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:26,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:26,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:26,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:26,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:26,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:26,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:26,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:26,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:39:26,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:39:26,201 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. cyclomatic complexity: 39 Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:26,627 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2025-03-04 15:39:26,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 224 transitions. [2025-03-04 15:39:26,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:26,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 160 states and 184 transitions. [2025-03-04 15:39:26,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2025-03-04 15:39:26,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2025-03-04 15:39:26,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 184 transitions. [2025-03-04 15:39:26,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:26,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 184 transitions. [2025-03-04 15:39:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 184 transitions. [2025-03-04 15:39:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2025-03-04 15:39:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 1.155844155844156) internal successors, (178), 153 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2025-03-04 15:39:26,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 178 transitions. [2025-03-04 15:39:26,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:39:26,632 INFO L432 stractBuchiCegarLoop]: Abstraction has 154 states and 178 transitions. [2025-03-04 15:39:26,632 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-04 15:39:26,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 178 transitions. [2025-03-04 15:39:26,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:26,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:26,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:26,633 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, 1] [2025-03-04 15:39:26,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:26,633 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_#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-04 15:39:26,634 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-04 15:39:26,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2105113051, now seen corresponding path program 4 times [2025-03-04 15:39:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964194404] [2025-03-04 15:39:26,634 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:39:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:26,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:39:26,659 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:39:26,659 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:39:26,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:39:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964194404] [2025-03-04 15:39:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964194404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919306104] [2025-03-04 15:39:27,578 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:39:27,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:27,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:27,582 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:27,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2025-03-04 15:39:27,682 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:39:27,728 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:39:27,728 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:39:27,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:27,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 15:39:27,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:27,739 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-04 15:39:27,836 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-04 15:39:27,887 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:39:27,887 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-04 15:39:27,947 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-04 15:39:27,977 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-04 15:39:27,984 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-04 15:39:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 15:39:28,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:28,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_main_~needle~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~hay~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~hay~0#1.offset|)) 0)) is different from false [2025-03-04 15:39:28,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:39:28,322 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 23 treesize of output 24 [2025-03-04 15:39:28,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:39:28,335 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 37 treesize of output 32 [2025-03-04 15:39:28,341 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 11 treesize of output 7 [2025-03-04 15:39:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 15:39:28,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919306104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:28,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:28,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 33 [2025-03-04 15:39:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346925625] [2025-03-04 15:39:28,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:28,535 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:28,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:28,536 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 9 times [2025-03-04 15:39:28,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:28,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279300801] [2025-03-04 15:39:28,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:39:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:28,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:28,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:28,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:39:28,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:28,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:28,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:28,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:28,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:28,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:28,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:28,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 15:39:28,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=918, Unknown=1, NotChecked=60, Total=1056 [2025-03-04 15:39:28,655 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. cyclomatic complexity: 36 Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:30,607 INFO L93 Difference]: Finished difference Result 311 states and 358 transitions. [2025-03-04 15:39:30,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 311 states and 358 transitions. [2025-03-04 15:39:30,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:39:30,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 311 states to 278 states and 322 transitions. [2025-03-04 15:39:30,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2025-03-04 15:39:30,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2025-03-04 15:39:30,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 322 transitions. [2025-03-04 15:39:30,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:30,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 278 states and 322 transitions. [2025-03-04 15:39:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 322 transitions. [2025-03-04 15:39:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 169. [2025-03-04 15:39:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 1.165680473372781) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2025-03-04 15:39:30,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 169 states and 197 transitions. [2025-03-04 15:39:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 15:39:30,617 INFO L432 stractBuchiCegarLoop]: Abstraction has 169 states and 197 transitions. [2025-03-04 15:39:30,617 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-04 15:39:30,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 197 transitions. [2025-03-04 15:39:30,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:30,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:30,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:30,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 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-04 15:39:30,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:30,619 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_#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_#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-04 15:39:30,620 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-04 15:39:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 305620101, now seen corresponding path program 1 times [2025-03-04 15:39:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:30,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75833441] [2025-03-04 15:39:30,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:30,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:30,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:39:30,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:39:30,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:30,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 15:39:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75833441] [2025-03-04 15:39:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75833441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451277552] [2025-03-04 15:39:30,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:30,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:30,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:30,992 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:30,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2025-03-04 15:39:31,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:39:31,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:39:31,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:31,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:31,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 15:39:31,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:31,138 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-04 15:39:31,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:39:31,295 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-04 15:39:31,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:39:31,312 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-04 15:39:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:39:31,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:31,827 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:39:31,827 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-04 15:39:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:39:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451277552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:31,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2025-03-04 15:39:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186359386] [2025-03-04 15:39:31,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:31,884 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:31,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 10 times [2025-03-04 15:39:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479529717] [2025-03-04 15:39:31,884 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:39:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:31,887 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:39:31,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:31,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:39:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:31,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:31,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:31,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:31,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:31,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:31,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:31,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:39:31,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:39:31,984 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. cyclomatic complexity: 42 Second operand has 26 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:33,088 INFO L93 Difference]: Finished difference Result 315 states and 360 transitions. [2025-03-04 15:39:33,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 360 transitions. [2025-03-04 15:39:33,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:39:33,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 194 states and 226 transitions. [2025-03-04 15:39:33,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2025-03-04 15:39:33,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2025-03-04 15:39:33,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 226 transitions. [2025-03-04 15:39:33,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:33,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 226 transitions. [2025-03-04 15:39:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 226 transitions. [2025-03-04 15:39:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 137. [2025-03-04 15:39:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.1605839416058394) internal successors, (159), 136 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2025-03-04 15:39:33,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 159 transitions. [2025-03-04 15:39:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 15:39:33,092 INFO L432 stractBuchiCegarLoop]: Abstraction has 137 states and 159 transitions. [2025-03-04 15:39:33,092 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-04 15:39:33,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 159 transitions. [2025-03-04 15:39:33,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:39:33,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:33,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:33,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 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-04 15:39:33,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:39:33,093 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_#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-04 15:39:33,094 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-04 15:39:33,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1421529355, now seen corresponding path program 5 times [2025-03-04 15:39:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205550312] [2025-03-04 15:39:33,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:39:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:33,107 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-04 15:39:33,141 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:39:33,141 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 15:39:33,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 15:39:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:33,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205550312] [2025-03-04 15:39:33,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205550312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:33,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302772787] [2025-03-04 15:39:33,538 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:39:33,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:33,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:33,542 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:33,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2025-03-04 15:39:33,643 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-04 15:39:33,689 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:39:33,689 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 15:39:33,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:33,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 15:39:33,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:33,703 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-04 15:39:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:39:34,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 15:39:35,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302772787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:35,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:35,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 13] total 41 [2025-03-04 15:39:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392923658] [2025-03-04 15:39:35,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:35,225 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:35,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash 53587, now seen corresponding path program 11 times [2025-03-04 15:39:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513908414] [2025-03-04 15:39:35,225 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:39:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:35,229 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:35,230 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:35,230 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:35,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:35,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:35,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:35,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:35,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:35,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:35,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:35,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 15:39:35,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 15:39:35,376 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. cyclomatic complexity: 33 Second operand has 41 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 41 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:59,926 WARN L286 SmtUtils]: Spent 24.12s on a formula simplification. DAG size of input: 20 DAG size of output: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 15:40:12,036 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 16 DAG size of output: 17 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)