./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strcspn.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/strcspn.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 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:54:56,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:54:56,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:54:56,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:54:56,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:54:56,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:54:56,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:54:56,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:54:56,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:54:56,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:54:56,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:54:56,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:54:56,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:54:56,740 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:54:56,740 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:54:56,740 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:54:56,740 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:54:56,740 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:54:56,740 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:54:56,740 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:54:56,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:54:56,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:54:56,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:54:56,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:54:56,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:54:56,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:54:56,742 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:54:56,742 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 -> 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 [2025-03-17 19:54:56,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:54:56,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:54:56,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:54:56,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:54:56,962 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:54:56,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcspn.i [2025-03-17 19:54:58,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17bcdbc1/b9aaf974c45b481ea15d5d557e10adca/FLAG3d99f5d10 [2025-03-17 19:54:58,287 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:54:58,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2025-03-17 19:54:58,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17bcdbc1/b9aaf974c45b481ea15d5d557e10adca/FLAG3d99f5d10 [2025-03-17 19:54:58,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17bcdbc1/b9aaf974c45b481ea15d5d557e10adca [2025-03-17 19:54:58,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:54:58,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:54:58,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:54:58,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:54:58,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:54:58,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c73cc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58, skipping insertion in model container [2025-03-17 19:54:58,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:54:58,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:54:58,825 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:54:58,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:54:58,869 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:54:58,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58 WrapperNode [2025-03-17 19:54:58,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:54:58,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:54:58,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:54:58,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:54:58,874 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:54:58" (1/1) ... [2025-03-17 19:54:58,880 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:54:58" (1/1) ... [2025-03-17 19:54:58,892 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-03-17 19:54:58,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:54:58,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:54:58,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:54:58,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:54:58,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,906 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-17 19:54:58,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:54:58,913 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:54:58,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:54:58,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:54:58,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (1/1) ... [2025-03-17 19:54:58,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:54:58,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:54:58,941 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:54:58,943 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:54:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:54:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:54:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:54:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:54:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:54:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:54:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:54:58,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:54:59,025 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:54:59,026 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:54:59,147 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L526: havoc main_#t~ret13#1;call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset; [2025-03-17 19:54:59,155 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-17 19:54:59,156 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:54:59,164 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:54:59,165 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:54:59,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:54:59 BoogieIcfgContainer [2025-03-17 19:54:59,165 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:54:59,166 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:54:59,167 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:54:59,170 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:54:59,171 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:54:59,171 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:54:58" (1/3) ... [2025-03-17 19:54:59,172 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48277841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:54:59, skipping insertion in model container [2025-03-17 19:54:59,172 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:54:59,172 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:54:58" (2/3) ... [2025-03-17 19:54:59,173 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48277841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:54:59, skipping insertion in model container [2025-03-17 19:54:59,173 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:54:59,173 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:54:59" (3/3) ... [2025-03-17 19:54:59,174 INFO L363 chiAutomizerObserver]: Analyzing ICFG strcspn.i [2025-03-17 19:54:59,202 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:54:59,202 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:54:59,202 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:54:59,202 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:54:59,202 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:54:59,203 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:54:59,203 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:54:59,203 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:54:59,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:54:59,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:54:59,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:54:59,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:54:59,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:54:59,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:54:59,217 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:54:59,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:54:59,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:54:59,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:54:59,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:54:59,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:54:59,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:54:59,221 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;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~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" [2025-03-17 19:54:59,221 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem2#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" "assume !true;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset;" [2025-03-17 19:54:59,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:54:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash 63516, now seen corresponding path program 1 times [2025-03-17 19:54:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:54:59,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771406336] [2025-03-17 19:54:59,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:54:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:54:59,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:54:59,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:54:59,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:54:59,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:54:59,323 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:54:59,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:54:59,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:54:59,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:54:59,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:54:59,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:54:59,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:54:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1599637, now seen corresponding path program 1 times [2025-03-17 19:54:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:54:59,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785502550] [2025-03-17 19:54:59,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:54:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:54:59,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:54:59,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:54:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:54:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:54:59,391 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:54:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:54:59,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785502550] [2025-03-17 19:54:59,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785502550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:54:59,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:54:59,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:54:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984321220] [2025-03-17 19:54:59,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:54:59,395 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:54:59,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:54:59,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:54:59,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:54:59,417 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:54:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:54:59,420 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-03-17 19:54:59,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-03-17 19:54:59,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:54:59,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 10 transitions. [2025-03-17 19:54:59,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:54:59,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:54:59,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2025-03-17 19:54:59,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:54:59,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-17 19:54:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2025-03-17 19:54:59,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:54:59,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:54:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-17 19:54:59,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-17 19:54:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:54:59,442 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-17 19:54:59,442 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:54:59,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-03-17 19:54:59,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:54:59,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:54:59,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:54:59,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:54:59,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:54:59,443 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;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~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" [2025-03-17 19:54:59,443 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem2#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" "assume true;call strcspn_#t~mem3#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(0 != strcspn_#t~mem3#1);havoc strcspn_#t~mem3#1;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset;" [2025-03-17 19:54:59,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:54:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash 63516, now seen corresponding path program 2 times [2025-03-17 19:54:59,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:54:59,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067303510] [2025-03-17 19:54:59,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:54:59,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:54:59,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:54:59,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:54:59,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:54:59,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:54:59,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:54:59,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:54:59,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:54:59,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:54:59,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:54:59,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:54:59,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:54:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash 49588040, now seen corresponding path program 1 times [2025-03-17 19:54:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:54:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899501554] [2025-03-17 19:54:59,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:54:59,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:54:59,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:54:59,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:54:59,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:54:59,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:54:59,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:54:59,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:54:59,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:54:59,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:54:59,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:54:59,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:54:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:54:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1658947597, now seen corresponding path program 1 times [2025-03-17 19:54:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:54:59,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881022393] [2025-03-17 19:54:59,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:54:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:54:59,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:54:59,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:54:59,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:54:59,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:54:59,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:54:59,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:54:59,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:54:59,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:54:59,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:54:59,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:00,272 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:00,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:00,273 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:00,273 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:00,273 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:00,273 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:00,273 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:00,273 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:00,274 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration2_Lasso [2025-03-17 19:55:00,274 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:00,274 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:00,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:00,789 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:00,791 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:00,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:00,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:00,794 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:00,795 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:00,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:00,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:00,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:00,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:00,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:00,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:00,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:00,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:00,811 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:00,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:55:00,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:00,818 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:00,819 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:00,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:00,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:00,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:00,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:00,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:00,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:00,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:00,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:00,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:00,837 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:00,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:00,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:00,839 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:00,841 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:00,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:00,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:00,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:00,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:00,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:00,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:00,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:00,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:00,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:00,858 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:00,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:00,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:00,860 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:00,861 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:00,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:00,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:00,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:00,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:00,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:00,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:00,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:00,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:00,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:00,879 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:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:00,881 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:00,882 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:00,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:00,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:00,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:00,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:00,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:00,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:00,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:00,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:00,915 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:00,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:00,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:00,917 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:00,918 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:00,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:00,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:00,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:00,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:00,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:00,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:00,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:00,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:00,971 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-17 19:55:00,976 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 19:55:00,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:00,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:00,979 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:00,980 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:00,981 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:00,992 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:00,992 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:00,992 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~s#1.base)_1, ULTIMATE.start_strcspn_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_strcspn_~s#1.base)_1 - 1*ULTIMATE.start_strcspn_~s#1.offset Supporting invariants [] [2025-03-17 19:55:00,998 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:01,020 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-17 19:55:01,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:55:01,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:55:01,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-17 19:55:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:01,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:01,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:01,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:01,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:01,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:01,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:01,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:55:01,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:55:01,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:01,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:55:01,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:01,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:01,120 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:01,122 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:55:01,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:01,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 18 transitions. Complement of second has 4 states. [2025-03-17 19:55:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-03-17 19:55:01,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2025-03-17 19:55:01,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:01,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-17 19:55:01,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:01,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2025-03-17 19:55:01,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:01,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2025-03-17 19:55:01,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:01,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 17 transitions. [2025-03-17 19:55:01,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:55:01,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:55:01,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2025-03-17 19:55:01,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:01,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-17 19:55:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2025-03-17 19:55:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 19:55:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-03-17 19:55:01,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-17 19:55:01,162 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-17 19:55:01,162 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:55:01,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2025-03-17 19:55:01,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:01,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:01,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:01,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:55:01,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:01,163 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;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~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" "assume true;call strcspn_#t~mem2#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" [2025-03-17 19:55:01,163 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume 0 != strcspn_#t~mem3#1;havoc strcspn_#t~mem3#1;call strcspn_#t~mem4#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;strcspn_#t~pre6#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre6#1;" [2025-03-17 19:55:01,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash 61039579, now seen corresponding path program 1 times [2025-03-17 19:55:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:01,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798472974] [2025-03-17 19:55:01,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:01,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:55:01,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:55:01,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:01,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:01,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:01,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:55:01,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:55:01,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:01,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:01,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:01,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 1 times [2025-03-17 19:55:01,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:01,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29512133] [2025-03-17 19:55:01,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:01,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:01,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:01,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:01,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:01,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:01,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:01,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:01,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:01,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:01,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:01,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:01,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1658947633, now seen corresponding path program 1 times [2025-03-17 19:55:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709579703] [2025-03-17 19:55:01,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:01,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:55:01,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:55:01,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:01,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:01,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:01,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:55:01,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:55:01,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:01,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:01,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:01,759 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:01,759 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:01,759 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:01,760 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:01,760 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:01,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:01,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:01,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:01,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration3_Lasso [2025-03-17 19:55:01,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:01,760 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:01,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:01,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:02,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:02,256 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:02,256 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:02,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,262 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:02,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:55:02,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:02,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:02,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:02,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:02,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:02,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:02,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,285 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:02,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:55:02,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:02,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:02,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:02,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:02,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:02,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:02,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,307 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:02,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:55:02,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:02,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:02,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:02,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:02,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:02,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:02,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,328 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:02,329 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:02,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:02,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:02,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:02,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:02,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:02,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:02,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,349 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:02,349 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:02,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:02,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:02,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:02,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:02,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:02,366 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:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,368 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:02,368 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:02,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:02,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:02,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:02,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:02,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:02,385 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:02,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,387 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:02,387 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:02,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:02,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:02,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:02,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:02,408 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:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,410 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:02,411 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:02,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:02,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:02,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:02,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:02,434 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:02,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,436 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:02,437 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:02,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:02,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:02,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:02,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:02,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:02,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:02,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:02,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:02,481 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-17 19:55:02,481 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 19:55:02,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:02,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,483 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:02,484 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:02,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:02,498 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 19:55:02,498 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:02,498 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_2, ULTIMATE.start_strcspn_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_2 - 1*ULTIMATE.start_strcspn_~i~0#1 Supporting invariants [1*ULTIMATE.start_strcspn_~reject#1.offset >= 0] [2025-03-17 19:55:02,505 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:02,527 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-17 19:55:02,529 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:55:02,529 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:55:02,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:02,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:55:02,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:55:02,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:02,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:02,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:55:02,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:02,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:02,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:02,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:02,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:02,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:55:02,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:02,599 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:02,599 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:55:02,599 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:02,630 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 41 transitions. Complement of second has 6 states. [2025-03-17 19:55:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-17 19:55:02,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-17 19:55:02,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:02,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 3 letters. [2025-03-17 19:55:02,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:02,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-17 19:55:02,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:02,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2025-03-17 19:55:02,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:02,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 27 transitions. [2025-03-17 19:55:02,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:55:02,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:55:02,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2025-03-17 19:55:02,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:02,636 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-17 19:55:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2025-03-17 19:55:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2025-03-17 19:55:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-17 19:55:02,637 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-17 19:55:02,637 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-17 19:55:02,637 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:55:02,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2025-03-17 19:55:02,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:02,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:02,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:02,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:02,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:02,640 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;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~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" "assume true;call strcspn_#t~mem2#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" "assume true;call strcspn_#t~mem3#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(0 != strcspn_#t~mem3#1);havoc strcspn_#t~mem3#1;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset;" "assume true;call strcspn_#t~mem2#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" [2025-03-17 19:55:02,640 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume 0 != strcspn_#t~mem3#1;havoc strcspn_#t~mem3#1;call strcspn_#t~mem4#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;strcspn_#t~pre6#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre6#1;" [2025-03-17 19:55:02,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:02,641 INFO L85 PathProgramCache]: Analyzing trace with hash 815774604, now seen corresponding path program 2 times [2025-03-17 19:55:02,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:02,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173631163] [2025-03-17 19:55:02,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:02,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:02,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 19:55:02,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:55:02,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:02,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:02,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:02,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:55:02,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:55:02,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:02,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:02,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:02,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 2 times [2025-03-17 19:55:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:02,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743736128] [2025-03-17 19:55:02,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:02,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:02,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:02,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:02,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:02,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:02,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:02,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:02,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:02,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:02,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:02,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1816282848, now seen corresponding path program 1 times [2025-03-17 19:55:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635904826] [2025-03-17 19:55:02,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:02,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:02,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:02,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:02,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:02,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:02,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635904826] [2025-03-17 19:55:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635904826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:55:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645603711] [2025-03-17 19:55:02,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:02,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:55:02,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:02,943 INFO L229 MonitoredProcess]: Starting monitored process 19 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:02,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 19:55:02,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:02,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:02,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:02,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:02,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:55:02,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:03,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:55:03,074 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 19:55:03,075 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 18 treesize of output 11 [2025-03-17 19:55:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645603711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:55:03,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:55:03,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-17 19:55:03,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072559542] [2025-03-17 19:55:03,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:55:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:03,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:55:03,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:55:03,134 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 6 Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:03,191 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-17 19:55:03,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2025-03-17 19:55:03,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:03,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 31 transitions. [2025-03-17 19:55:03,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 19:55:03,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 19:55:03,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2025-03-17 19:55:03,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:03,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-17 19:55:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2025-03-17 19:55:03,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2025-03-17 19:55:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-17 19:55:03,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-17 19:55:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:55:03,197 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-17 19:55:03,197 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:55:03,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2025-03-17 19:55:03,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:55:03,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:03,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:03,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:03,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:55:03,198 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;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~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" "assume true;call strcspn_#t~mem2#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" "assume true;call strcspn_#t~mem3#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume 0 != strcspn_#t~mem3#1;havoc strcspn_#t~mem3#1;call strcspn_#t~mem4#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;strcspn_#t~pre6#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre6#1;" "assume true;call strcspn_#t~mem3#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(0 != strcspn_#t~mem3#1);havoc strcspn_#t~mem3#1;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset;" "assume true;call strcspn_#t~mem2#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" [2025-03-17 19:55:03,198 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume 0 != strcspn_#t~mem3#1;havoc strcspn_#t~mem3#1;call strcspn_#t~mem4#1 := read~int#0(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#1(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;strcspn_#t~pre6#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre6#1;" [2025-03-17 19:55:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1453794058, now seen corresponding path program 2 times [2025-03-17 19:55:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:03,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641818482] [2025-03-17 19:55:03,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:03,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:55:03,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:03,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:03,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:03,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:03,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:03,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:03,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:03,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:03,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:03,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 3 times [2025-03-17 19:55:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:03,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452387224] [2025-03-17 19:55:03,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:03,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:03,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:03,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:03,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:03,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:03,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:03,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:03,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:03,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:03,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:03,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash 471446838, now seen corresponding path program 3 times [2025-03-17 19:55:03,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357105260] [2025-03-17 19:55:03,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:03,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:03,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-17 19:55:03,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:55:03,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:55:03,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:03,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:03,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:55:03,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:55:03,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:03,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:03,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:03,888 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:03,888 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:03,888 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:03,888 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:03,888 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:03,888 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:03,888 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:03,888 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:03,888 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration5_Lasso [2025-03-17 19:55:03,888 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:03,888 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:03,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:04,530 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:04,530 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:04,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:04,532 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:04,533 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:04,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:04,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:04,543 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2025-03-17 19:55:04,543 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-17 19:55:04,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:04,588 INFO L401 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2025-03-17 19:55:04,588 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-03-17 19:55:04,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:04,676 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:04,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:04,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:04,678 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:04,678 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:04,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:04,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:04,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:04,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:04,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:04,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:04,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:04,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:04,700 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:04,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:04,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:04,702 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:04,703 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:04,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:04,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:04,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:04,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:04,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:04,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:04,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:04,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:04,721 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:04,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:04,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:04,723 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:04,723 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:04,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:04,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:04,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:04,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:04,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:04,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:04,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:04,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:04,763 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-17 19:55:04,763 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 19:55:04,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:04,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:04,765 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:04,766 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:04,767 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:04,777 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 19:55:04,777 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:04,777 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0#1) = -2*ULTIMATE.start_strcspn_~i~0#1 + 36893488147419103229 Supporting invariants [1*ULTIMATE.start_strcspn_~reject#1.offset - 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 + 18446744073709551615 >= 0] [2025-03-17 19:55:04,783 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:04,808 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-17 19:55:04,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:04,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:04,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:04,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:04,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:04,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:55:04,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:04,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 19:55:04,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:04,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:04,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:04,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:04,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:55:04,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:04,955 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:04,955 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:55:04,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:04,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 38 transitions. Complement of second has 6 states. [2025-03-17 19:55:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-17 19:55:04,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:55:04,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:04,995 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:55:05,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:05,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:05,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:05,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:05,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:05,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:55:05,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:05,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 19:55:05,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:05,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:05,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:05,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:05,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:55:05,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:05,132 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:05,132 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:55:05,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:05,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 38 transitions. Complement of second has 6 states. [2025-03-17 19:55:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-17 19:55:05,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:55:05,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:05,163 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:55:05,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:05,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:05,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:05,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:05,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:05,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:55:05,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:05,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 19:55:05,261 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:05,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:55:05,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:55:05,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:05,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:05,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:55:05,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:05,311 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:05,311 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:55:05,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:05,358 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 42 transitions. Complement of second has 5 states. [2025-03-17 19:55:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2025-03-17 19:55:05,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:55:05,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:05,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-17 19:55:05,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:05,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-17 19:55:05,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:05,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2025-03-17 19:55:05,363 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:55:05,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-03-17 19:55:05,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:55:05,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:55:05,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:55:05,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:05,364 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:55:05,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:55:05,364 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:55:05,364 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:55:05,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:55:05,364 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:55:05,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:55:05,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:55:05 BoogieIcfgContainer [2025-03-17 19:55:05,369 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:55:05,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:55:05,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:55:05,370 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:55:05,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:54:59" (3/4) ... [2025-03-17 19:55:05,372 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:55:05,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:55:05,373 INFO L158 Benchmark]: Toolchain (without parser) took 6744.02ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.7MB in the beginning and 125.8MB in the end (delta: -14.2MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2025-03-17 19:55:05,373 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:05,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.10ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 95.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:55:05,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.23ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:05,373 INFO L158 Benchmark]: Boogie Preprocessor took 18.87ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:05,373 INFO L158 Benchmark]: IcfgBuilder took 251.95ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 78.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:55:05,374 INFO L158 Benchmark]: BuchiAutomizer took 6203.83ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.4MB in the beginning and 125.9MB in the end (delta: -47.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:05,374 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 176.2MB. Free memory was 125.9MB in the beginning and 125.8MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:05,375 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.13ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.10ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 95.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.23ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.87ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 251.95ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 78.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6203.83ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.4MB in the beginning and 125.9MB in the end (delta: -47.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 176.2MB. Free memory was 125.9MB in the beginning and 125.8MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s!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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function ((((unsigned __int128) 1 << 64) | 18446744073709551613U) + ((long) -2 * i)) and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 64 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf100 lsp97 ukn69 mio100 lsp29 div100 bol100 ite100 ukn100 eq150 hnf93 smp98 dnf296 smp90 tf100 neg100 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 139ms VariablesStem: 5 VariablesLoop: 3 DisjunctsStem: 12 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 136 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 19:55:05,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:05,587 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 Writing output log to file Ultimate.log Result: TRUE