./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strrchr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/strrchr.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 b850f5453e922b3972aa9b5b79a1b07337c08d581cc5e6a2a56803408dc479cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:55:08,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:55:08,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:55:08,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:55:08,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:55:08,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:55:08,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:55:08,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:55:08,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:55:08,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:55:08,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:55:08,757 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:55:08,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:55:08,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:55:08,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:55:08,760 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:55:08,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:55:08,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:55:08,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:55:08,760 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:55:08,760 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 -> b850f5453e922b3972aa9b5b79a1b07337c08d581cc5e6a2a56803408dc479cf [2025-03-17 19:55:08,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:55:08,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:55:08,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:55:08,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:55:08,981 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:55:08,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strrchr.i [2025-03-17 19:55:10,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258ffa430/f6a65b678fdf4376930214f4baa44f79/FLAGf05c2116e [2025-03-17 19:55:10,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:55:10,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strrchr.i [2025-03-17 19:55:10,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258ffa430/f6a65b678fdf4376930214f4baa44f79/FLAGf05c2116e [2025-03-17 19:55:10,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258ffa430/f6a65b678fdf4376930214f4baa44f79 [2025-03-17 19:55:10,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:55:10,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:55:10,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:55:10,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:55:10,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:55:10,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f9ca31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10, skipping insertion in model container [2025-03-17 19:55:10,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:55:10,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:55:10,590 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:55:10,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:55:10,635 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:55:10,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10 WrapperNode [2025-03-17 19:55:10,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:55:10,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:55:10,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:55:10,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:55:10,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,661 INFO L138 Inliner]: procedures = 114, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2025-03-17 19:55:10,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:55:10,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:55:10,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:55:10,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:55:10,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,677 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 2 writes are split as follows [2]. [2025-03-17 19:55:10,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:55:10,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:55:10,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:55:10,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:55:10,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (1/1) ... [2025-03-17 19:55:10,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:10,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:10,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:10,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:55:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:55:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:55:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:55:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:55:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:55:10,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:55:10,783 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:55:10,784 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:55:10,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_#t~ret19#1.base, main_#t~ret19#1.offset;call ULTIMATE.dealloc(main_#t~malloc15#1.base, main_#t~malloc15#1.offset);havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset; [2025-03-17 19:55:10,940 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 19:55:10,940 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:55:10,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:55:10,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:55:10,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:55:10 BoogieIcfgContainer [2025-03-17 19:55:10,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:55:10,950 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:55:10,950 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:55:10,953 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:55:10,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:10,953 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:55:10" (1/3) ... [2025-03-17 19:55:10,954 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37dcc456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:55:10, skipping insertion in model container [2025-03-17 19:55:10,954 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:10,954 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:10" (2/3) ... [2025-03-17 19:55:10,954 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37dcc456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:55:10, skipping insertion in model container [2025-03-17 19:55:10,954 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:10,954 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:55:10" (3/3) ... [2025-03-17 19:55:10,955 INFO L363 chiAutomizerObserver]: Analyzing ICFG strrchr.i [2025-03-17 19:55:10,982 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:55:10,982 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:55:10,982 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:55:10,982 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:55:10,982 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:55:10,982 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:55:10,982 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:55:10,983 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:55:10,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:10,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 19:55:10,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:10,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:10,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:55:10,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:55:10,999 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:55:10,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:11,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 19:55:11,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:11,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:11,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:55:11,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:55:11,004 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" [2025-03-17 19:55:11,004 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" [2025-03-17 19:55:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2432, now seen corresponding path program 1 times [2025-03-17 19:55:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855835831] [2025-03-17 19:55:11,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:11,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:11,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:11,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:11,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:11,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:11,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:11,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:11,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:11,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:11,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:11,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times [2025-03-17 19:55:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750947371] [2025-03-17 19:55:11,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:11,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:11,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:11,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:11,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:11,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:11,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:11,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:11,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:11,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:11,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:11,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:11,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash 75432, now seen corresponding path program 1 times [2025-03-17 19:55:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545667446] [2025-03-17 19:55:11,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:11,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:11,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:11,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:11,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:11,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:11,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:11,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:11,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:11,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:11,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:11,392 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:11,392 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:11,392 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:11,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:11,393 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:11,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:11,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:11,395 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:11,395 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration1_Lasso [2025-03-17 19:55:11,395 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:11,396 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:11,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:11,748 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:11,750 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:11,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:11,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:11,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:11,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:55:11,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:11,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:11,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:11,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:11,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:11,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:11,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:11,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:11,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:11,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:11,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:11,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:11,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:11,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:11,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:55:11,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:11,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:11,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:11,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:11,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:11,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:11,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:11,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 19:55:11,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:11,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:11,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:11,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:55:11,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:11,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:11,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:11,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:11,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:11,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:11,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:11,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:11,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:11,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:11,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:11,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:11,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:11,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:55:11,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:11,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:11,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:11,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:11,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:11,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:11,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:11,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:11,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 19:55:11,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:11,866 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:11,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:55:11,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:11,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:11,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:11,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:11,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:11,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:11,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:11,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:11,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 19:55:11,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:11,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:11,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:11,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:55:11,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:11,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:11,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:11,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:11,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:11,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:11,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:11,922 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:11,939 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-17 19:55:11,941 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-17 19:55:11,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:11,944 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:11,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:55:11,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:11,959 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:11,959 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:11,959 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~in_len~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~in_len~0#1 Supporting invariants [] [2025-03-17 19:55:11,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:11,973 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-17 19:55:11,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:11,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:11,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:12,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:12,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:12,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:12,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:12,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:12,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:12,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:55:12,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:12,035 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 19:55:12,036 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:12,061 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 36 transitions. Complement of second has 3 states. [2025-03-17 19:55:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-03-17 19:55:12,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 19:55:12,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:12,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-17 19:55:12,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:12,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-17 19:55:12,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:12,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2025-03-17 19:55:12,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:12,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 24 transitions. [2025-03-17 19:55:12,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-17 19:55:12,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-17 19:55:12,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-03-17 19:55:12,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:12,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-17 19:55:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-03-17 19:55:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-17 19:55:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-03-17 19:55:12,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-17 19:55:12,094 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-17 19:55:12,094 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:55:12,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2025-03-17 19:55:12,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:12,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:12,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:12,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:55:12,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:12,095 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-03-17 19:55:12,096 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-03-17 19:55:12,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash 75431, now seen corresponding path program 1 times [2025-03-17 19:55:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454598286] [2025-03-17 19:55:12,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:12,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:12,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:12,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:12,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:12,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:12,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:12,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:12,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:12,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 1 times [2025-03-17 19:55:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:12,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808199765] [2025-03-17 19:55:12,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:12,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:12,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:12,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:12,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:12,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:12,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:12,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:12,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:12,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 92388367, now seen corresponding path program 1 times [2025-03-17 19:55:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366457474] [2025-03-17 19:55:12,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:12,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:55:12,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:55:12,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:12,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:12,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366457474] [2025-03-17 19:55:12,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366457474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:12,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:12,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:55:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526432870] [2025-03-17 19:55:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:12,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:55:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:12,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:55:12,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:55:12,773 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:12,812 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2025-03-17 19:55:12,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2025-03-17 19:55:12,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:12,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 22 transitions. [2025-03-17 19:55:12,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-17 19:55:12,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-17 19:55:12,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2025-03-17 19:55:12,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:12,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-17 19:55:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2025-03-17 19:55:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-17 19:55:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-17 19:55:12,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-17 19:55:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:55:12,816 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-17 19:55:12,816 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:55:12,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2025-03-17 19:55:12,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:12,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:12,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:12,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:55:12,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:12,817 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-03-17 19:55:12,817 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-03-17 19:55:12,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:12,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2338431, now seen corresponding path program 1 times [2025-03-17 19:55:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:12,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464362317] [2025-03-17 19:55:12,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:55:12,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:55:12,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:12,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:12,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:55:12,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:55:12,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:12,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:12,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 2 times [2025-03-17 19:55:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:12,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173633355] [2025-03-17 19:55:12,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:12,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:12,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:12,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:12,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:12,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:12,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:12,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:12,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:12,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:12,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1427419959, now seen corresponding path program 1 times [2025-03-17 19:55:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:12,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188492706] [2025-03-17 19:55:12,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:12,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:55:12,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:55:12,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:12,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:13,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188492706] [2025-03-17 19:55:13,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188492706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754960920] [2025-03-17 19:55:13,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:13,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:13,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:13,039 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:13,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:55:13,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:55:13,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:55:13,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:13,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:13,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 19:55:13,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:13,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:55:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:13,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:13,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:55:13,480 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 134 treesize of output 128 [2025-03-17 19:55:13,500 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 31 treesize of output 27 [2025-03-17 19:55:13,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:55:13,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 113 [2025-03-17 19:55:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754960920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:13,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 23 [2025-03-17 19:55:13,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606325637] [2025-03-17 19:55:13,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:13,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 19:55:13,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-17 19:55:13,829 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:14,166 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-03-17 19:55:14,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2025-03-17 19:55:14,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:14,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 23 transitions. [2025-03-17 19:55:14,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-17 19:55:14,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-17 19:55:14,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-03-17 19:55:14,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:14,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-17 19:55:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-03-17 19:55:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-17 19:55:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-03-17 19:55:14,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-17 19:55:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:55:14,173 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-17 19:55:14,174 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:55:14,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2025-03-17 19:55:14,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:14,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:14,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:14,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2025-03-17 19:55:14,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:14,175 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-03-17 19:55:14,175 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-03-17 19:55:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash 72491431, now seen corresponding path program 2 times [2025-03-17 19:55:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715685558] [2025-03-17 19:55:14,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:14,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-03-17 19:55:14,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:55:14,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:14,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:14,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:55:14,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:55:14,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:14,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:14,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 3 times [2025-03-17 19:55:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653396499] [2025-03-17 19:55:14,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:14,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:14,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:14,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:14,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:14,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:14,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:14,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:14,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:14,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:14,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:14,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -136273649, now seen corresponding path program 2 times [2025-03-17 19:55:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765006603] [2025-03-17 19:55:14,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:14,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 19:55:14,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:55:14,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:14,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765006603] [2025-03-17 19:55:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765006603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599348792] [2025-03-17 19:55:14,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:14,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:14,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:55:14,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 19:55:14,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:55:14,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:14,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 19:55:14,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:14,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:55:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:14,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:14,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:55:14,951 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 102 treesize of output 98 [2025-03-17 19:55:14,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 14 [2025-03-17 19:55:14,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:55:14,987 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 67 treesize of output 53 [2025-03-17 19:55:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:15,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599348792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:15,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:15,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 13] total 28 [2025-03-17 19:55:15,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27452985] [2025-03-17 19:55:15,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:15,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:55:15,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:55:15,276 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 7 Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:15,769 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-03-17 19:55:15,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2025-03-17 19:55:15,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:15,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 19 states and 24 transitions. [2025-03-17 19:55:15,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-17 19:55:15,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-17 19:55:15,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2025-03-17 19:55:15,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:15,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-17 19:55:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2025-03-17 19:55:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-17 19:55:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-17 19:55:15,772 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-17 19:55:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:55:15,772 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-17 19:55:15,773 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:55:15,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2025-03-17 19:55:15,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:15,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:15,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:15,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2025-03-17 19:55:15,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:15,774 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-03-17 19:55:15,774 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-03-17 19:55:15,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:15,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2047732865, now seen corresponding path program 3 times [2025-03-17 19:55:15,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:15,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011330537] [2025-03-17 19:55:15,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:15,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:15,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 3 equivalence classes. [2025-03-17 19:55:15,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:15,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:55:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:15,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:15,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:15,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:15,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 4 times [2025-03-17 19:55:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:15,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681614056] [2025-03-17 19:55:15,790 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:15,793 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:55:15,795 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:15,795 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:15,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:15,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:15,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:15,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:15,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:15,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:15,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1366135241, now seen corresponding path program 3 times [2025-03-17 19:55:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:15,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235744029] [2025-03-17 19:55:15,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:15,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-17 19:55:15,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:55:15,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:55:15,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235744029] [2025-03-17 19:55:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235744029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860883804] [2025-03-17 19:55:16,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:16,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:16,132 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:16,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 19:55:16,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-17 19:55:16,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:55:16,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:55:16,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:16,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 19:55:16,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:16,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:55:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:16,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:16,475 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 40 treesize of output 34 [2025-03-17 19:55:16,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:55:16,479 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 67 treesize of output 53 [2025-03-17 19:55:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860883804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:16,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-03-17 19:55:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396366476] [2025-03-17 19:55:16,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:16,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:16,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 19:55:16,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2025-03-17 19:55:16,722 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:17,006 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-03-17 19:55:17,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2025-03-17 19:55:17,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:17,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2025-03-17 19:55:17,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-17 19:55:17,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-17 19:55:17,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2025-03-17 19:55:17,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:17,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-17 19:55:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2025-03-17 19:55:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-03-17 19:55:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-03-17 19:55:17,011 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-03-17 19:55:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:55:17,012 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-03-17 19:55:17,013 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:55:17,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2025-03-17 19:55:17,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:17,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:17,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:17,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-03-17 19:55:17,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:17,014 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-03-17 19:55:17,014 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-03-17 19:55:17,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash 944790695, now seen corresponding path program 4 times [2025-03-17 19:55:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802714897] [2025-03-17 19:55:17,014 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:17,021 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-03-17 19:55:17,024 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:17,024 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:17,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:17,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:17,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:17,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:17,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:17,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:17,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:17,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 5 times [2025-03-17 19:55:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424583008] [2025-03-17 19:55:17,030 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:55:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:17,033 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:17,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:17,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:17,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:17,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:17,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:17,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:17,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:17,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:17,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -837138929, now seen corresponding path program 4 times [2025-03-17 19:55:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:17,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176867935] [2025-03-17 19:55:17,042 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:17,046 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-17 19:55:17,054 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:55:17,054 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:17,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:17,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:17,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:55:17,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:55:17,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:17,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:17,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:17,668 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:17,668 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:17,668 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:17,668 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:17,668 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:17,668 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:17,668 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:17,668 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:17,668 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration6_Lasso [2025-03-17 19:55:17,668 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:17,668 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:17,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:17,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:18,125 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:18,125 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:18,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,128 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:55:18,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 19:55:18,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,161 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:55:18,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-17 19:55:18,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 19:55:18,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,180 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:55:18,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:55:18,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,199 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:55:18,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 19:55:18,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,218 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:55:18,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:55:18,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,237 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:55:18,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 19:55:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,256 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:55:18,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 19:55:18,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,275 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:55:18,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 19:55:18,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,295 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:55:18,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:55:18,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,314 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:55:18,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:18,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:18,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:18,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 19:55:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,333 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:55:18,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-17 19:55:18,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:18,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:18,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 19:55:18,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,355 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:55:18,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:18,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:18,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:55:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,382 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:55:18,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:18,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:18,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 19:55:18,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,402 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:55:18,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-17 19:55:18,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,413 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:55:18,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,426 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-17 19:55:18,426 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:55:18,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:18,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 19:55:18,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,450 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:55:18,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:18,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:18,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:18,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:18,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:18,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:18,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:18,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:18,486 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-17 19:55:18,486 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-17 19:55:18,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:18,488 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:18,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:55:18,489 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:18,499 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 19:55:18,500 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:18,500 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strrchr_~l~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc15#1.base)_2) = -1*ULTIMATE.start_strrchr_~l~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc15#1.base)_2 Supporting invariants [-1*ULTIMATE.start_strrchr_~l~0#1.offset + 1*ULTIMATE.start_strrchr_~t#1.offset >= 0] [2025-03-17 19:55:18,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 19:55:18,521 INFO L156 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 19:55:18,524 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~l~0!offset [2025-03-17 19:55:18,525 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:55:18,525 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:55:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:18,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:18,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:18,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:55:18,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:18,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:18,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:18,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:18,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:55:18,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:18,692 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2025-03-17 19:55:18,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:18,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 11. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 114 states and 148 transitions. Complement of second has 11 states. [2025-03-17 19:55:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2025-03-17 19:55:18,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 7 letters. Loop has 13 letters. [2025-03-17 19:55:18,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:18,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 20 letters. Loop has 13 letters. [2025-03-17 19:55:18,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:18,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 7 letters. Loop has 26 letters. [2025-03-17 19:55:18,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:18,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 148 transitions. [2025-03-17 19:55:18,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:18,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 148 transitions. [2025-03-17 19:55:18,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-03-17 19:55:18,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-03-17 19:55:18,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 148 transitions. [2025-03-17 19:55:18,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:18,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 148 transitions. [2025-03-17 19:55:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 148 transitions. [2025-03-17 19:55:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2025-03-17 19:55:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 83 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2025-03-17 19:55:18,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 113 transitions. [2025-03-17 19:55:18,890 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2025-03-17 19:55:18,891 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:55:18,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2025-03-17 19:55:18,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:18,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:18,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:18,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:18,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:18,892 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" [2025-03-17 19:55:18,892 INFO L754 eck$LassoCheckResult]: Loop: "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem11#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem11#1;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" [2025-03-17 19:55:18,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1685828150, now seen corresponding path program 1 times [2025-03-17 19:55:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619458790] [2025-03-17 19:55:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:18,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:55:18,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:55:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:18,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:55:18,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:55:18,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:18,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash 318340738, now seen corresponding path program 1 times [2025-03-17 19:55:18,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:18,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661181] [2025-03-17 19:55:18,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:18,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:18,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:18,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:18,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:18,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:18,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:18,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:18,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash 125422189, now seen corresponding path program 1 times [2025-03-17 19:55:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:18,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701316168] [2025-03-17 19:55:18,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:18,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:55:18,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:55:18,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:18,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:19,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 19:55:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701316168] [2025-03-17 19:55:19,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701316168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216337458] [2025-03-17 19:55:19,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:19,271 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:19,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-17 19:55:19,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:55:19,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:55:19,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:19,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:19,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 19:55:19,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:19,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:55:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:19,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:19,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 19:55:19,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-17 19:55:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216337458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:19,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:19,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2025-03-17 19:55:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606036823] [2025-03-17 19:55:19,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:19,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 19:55:19,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-03-17 19:55:19,679 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. cyclomatic complexity: 32 Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:19,920 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2025-03-17 19:55:19,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 142 transitions. [2025-03-17 19:55:19,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:19,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 73 states and 97 transitions. [2025-03-17 19:55:19,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-03-17 19:55:19,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-03-17 19:55:19,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 97 transitions. [2025-03-17 19:55:19,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:19,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-03-17 19:55:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 97 transitions. [2025-03-17 19:55:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-17 19:55:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 72 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2025-03-17 19:55:19,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-03-17 19:55:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:55:19,924 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-03-17 19:55:19,925 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:55:19,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 97 transitions. [2025-03-17 19:55:19,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:19,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:19,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:19,925 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:19,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:19,925 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" [2025-03-17 19:55:19,925 INFO L754 eck$LassoCheckResult]: Loop: "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem11#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem11#1;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" [2025-03-17 19:55:19,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2026744994, now seen corresponding path program 2 times [2025-03-17 19:55:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283913286] [2025-03-17 19:55:19,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:19,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:55:19,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:55:19,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:19,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:19,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:19,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:55:19,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:55:19,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:19,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:19,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash 318340738, now seen corresponding path program 2 times [2025-03-17 19:55:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:19,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647218926] [2025-03-17 19:55:19,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:19,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:19,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:19,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:19,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:19,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:19,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:19,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:19,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:19,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:19,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:19,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1123568197, now seen corresponding path program 2 times [2025-03-17 19:55:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:19,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348332323] [2025-03-17 19:55:19,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:19,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 19:55:19,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:55:19,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:19,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348332323] [2025-03-17 19:55:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348332323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637535157] [2025-03-17 19:55:20,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:20,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:20,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:20,279 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:20,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-17 19:55:20,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 19:55:20,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:55:20,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:20,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:20,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 19:55:20,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:20,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:55:20,504 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-17 19:55:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:20,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:20,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 19:55:20,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-17 19:55:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:20,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637535157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:20,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:20,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-17 19:55:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512564844] [2025-03-17 19:55:20,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:20,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:55:20,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:55:20,726 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. cyclomatic complexity: 27 Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:21,076 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2025-03-17 19:55:21,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 152 transitions. [2025-03-17 19:55:21,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:21,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 74 states and 98 transitions. [2025-03-17 19:55:21,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-03-17 19:55:21,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-03-17 19:55:21,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 98 transitions. [2025-03-17 19:55:21,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:21,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-17 19:55:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 98 transitions. [2025-03-17 19:55:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 19:55:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 73 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2025-03-17 19:55:21,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-17 19:55:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:55:21,080 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-17 19:55:21,080 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:55:21,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 98 transitions. [2025-03-17 19:55:21,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:21,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:21,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:21,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:21,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:21,081 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" [2025-03-17 19:55:21,081 INFO L754 eck$LassoCheckResult]: Loop: "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem11#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem11#1;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" [2025-03-17 19:55:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:21,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1152395466, now seen corresponding path program 3 times [2025-03-17 19:55:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568598990] [2025-03-17 19:55:21,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:21,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-03-17 19:55:21,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:55:21,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:55:21,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:21,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:21,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:55:21,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:55:21,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:21,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:21,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash 318340738, now seen corresponding path program 3 times [2025-03-17 19:55:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:21,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868660905] [2025-03-17 19:55:21,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:21,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:21,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:21,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:21,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:21,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:21,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:21,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:21,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:21,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:21,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2001323373, now seen corresponding path program 3 times [2025-03-17 19:55:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552262584] [2025-03-17 19:55:21,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:21,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-17 19:55:21,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:55:21,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:55:21,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552262584] [2025-03-17 19:55:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552262584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:21,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365039475] [2025-03-17 19:55:21,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:21,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:21,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:21,482 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:55:21,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-17 19:55:21,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-17 19:55:21,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:55:21,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:55:21,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:21,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 19:55:21,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:21,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:55:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:21,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:21,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 19:55:21,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-17 19:55:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365039475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:21,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 28 [2025-03-17 19:55:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958966343] [2025-03-17 19:55:21,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:21,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:55:21,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:55:21,964 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. cyclomatic complexity: 27 Second operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 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-17 19:55:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:22,342 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2025-03-17 19:55:22,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 168 transitions. [2025-03-17 19:55:22,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:22,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 75 states and 99 transitions. [2025-03-17 19:55:22,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-03-17 19:55:22,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-03-17 19:55:22,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 99 transitions. [2025-03-17 19:55:22,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:22,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 99 transitions. [2025-03-17 19:55:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 99 transitions. [2025-03-17 19:55:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 19:55:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2025-03-17 19:55:22,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 99 transitions. [2025-03-17 19:55:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:55:22,346 INFO L432 stractBuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2025-03-17 19:55:22,346 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:55:22,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2025-03-17 19:55:22,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-17 19:55:22,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:22,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:22,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:22,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:22,347 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~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" [2025-03-17 19:55:22,347 INFO L754 eck$LassoCheckResult]: Loop: "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem11#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem11#1;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" [2025-03-17 19:55:22,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 182636126, now seen corresponding path program 4 times [2025-03-17 19:55:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:22,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912554555] [2025-03-17 19:55:22,351 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:22,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-17 19:55:22,367 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:55:22,367 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:22,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:22,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:55:22,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:55:22,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:22,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:22,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:22,381 INFO L85 PathProgramCache]: Analyzing trace with hash 318340738, now seen corresponding path program 4 times [2025-03-17 19:55:22,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520355270] [2025-03-17 19:55:22,382 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:22,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:55:22,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:22,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:22,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:22,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:22,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:22,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:22,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:22,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash -853037243, now seen corresponding path program 4 times [2025-03-17 19:55:22,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:22,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044755867] [2025-03-17 19:55:22,391 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:55:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:22,396 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 19:55:22,404 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:55:22,404 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:55:22,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:22,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:55:22,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:55:22,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:22,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:22,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:24,308 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:24,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:24,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:24,308 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:24,308 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:24,308 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:24,309 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:24,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:24,309 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration10_Lasso [2025-03-17 19:55:24,309 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:24,309 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:24,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:24,794 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-03-17 19:55:33,481 WARN L286 SmtUtils]: Spent 7.71s on a formula simplification. DAG size of input: 184 DAG size of output: 128 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-03-17 19:55:33,560 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:33,560 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:33,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,566 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:33,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:55:33,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:33,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:33,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:33,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:33,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:33,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:33,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:33,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:33,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 19:55:33,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,586 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:33,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:55:33,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:33,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:33,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:33,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:33,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:33,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:33,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:33,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:33,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:55:33,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,606 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:33,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 19:55:33,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:33,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:33,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:33,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:33,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:33,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:33,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:33,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:33,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 19:55:33,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,625 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:33,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:55:33,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:33,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:33,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:33,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:33,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:33,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:33,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:33,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 19:55:33,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:33,647 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:33,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 19:55:33,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:33,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:33,660 INFO L203 nArgumentSynthesizer]: 28 stem disjuncts [2025-03-17 19:55:33,660 INFO L204 nArgumentSynthesizer]: 72 loop disjuncts [2025-03-17 19:55:33,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:49,122 INFO L401 nArgumentSynthesizer]: We have 14544 Motzkin's Theorem applications. [2025-03-17 19:55:49,122 INFO L402 nArgumentSynthesizer]: A total of 144 supporting invariants were added. [2025-03-17 19:56:08,761 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35) with exit command (exit)) stderr output: (error "out of memory") [2025-03-17 19:56:08,762 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 101 [2025-03-17 19:56:08,762 FATAL L? ?]: A wrapped exception occured: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer threw an exception: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.tryTemplatesAndComputePredicates(LassoCheck.java:703) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:668) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:915) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:364) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lassoranker.termination.TerminationArgumentSynthesizer.doSynthesis(TerminationArgumentSynthesizer.java:404) at de.uni_freiburg.informatik.ultimate.lassoranker.ArgumentSynthesizer.synthesize(ArgumentSynthesizer.java:137) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.tryTemplate(LassoAnalysis.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.tryTemplatesAndComputePredicates(LassoCheck.java:689) ... 18 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 26 more [2025-03-17 19:56:08,765 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lassoranker.termination.TerminationArgumentSynthesizer.doSynthesis(TerminationArgumentSynthesizer.java:404) at de.uni_freiburg.informatik.ultimate.lassoranker.ArgumentSynthesizer.synthesize(ArgumentSynthesizer.java:137) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.tryTemplate(LassoAnalysis.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.tryTemplatesAndComputePredicates(LassoCheck.java:689) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:668) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:915) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:364) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 26 more [2025-03-17 19:56:08,767 INFO L158 Benchmark]: Toolchain (without parser) took 58394.79ms. Allocated memory was 167.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 124.0MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-17 19:56:08,767 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:56:08,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.14ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 107.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:56:08,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.49ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 105.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:56:08,768 INFO L158 Benchmark]: Boogie Preprocessor took 22.46ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 104.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:56:08,768 INFO L158 Benchmark]: IcfgBuilder took 264.48ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 88.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:56:08,768 INFO L158 Benchmark]: BuchiAutomizer took 57817.12ms. Allocated memory was 167.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 88.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-17 19:56:08,769 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.14ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 107.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.49ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 105.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.46ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 104.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.48ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 88.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 57817.12ms. Allocated memory was 167.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 88.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~l~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-03-17 19:56:08,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:08,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-17 19:56:09,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:09,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 19:56:09,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:09,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:09,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")